[FEATURE] CSmith / cn-reduce experiment

[podhrmic]

Summary

Rosetta Code contains around 1600 C examples, from which around 800 compile (although with warnings). From the 843 ones that compile, 841 can be parsed with CN (but fail), but 2 of these lead to uncaught exceptions in CN and non-termination.

Use csmith/cn-reduce scripts to take the non-terminating experiments, and find a minimal example that leads to this behavior.

Push the results into cerberus repo for triage.

The parsing script is below:

#!/bin/bash

pass=0
fail=0
compiled=0
processed=0
OK=0

for d in `ls`;
do
    for f in `ls $d`;
    do
        echo ">>> Compiling $d/$f"
        processed=$((processed + 1))
        gcc $d/$f
        res=`echo $?`
        if [ "$res" = "$OK" ]; then
            echo ">>> Compilation OK, running cn!"
            compiled=$((compiled + 1))
            timeout 30 cn verify $d/$f
        else
            echo "Skipping $d/$f because it does not compile"
            continue
        fi
        res=`echo $?`
        if [ "$res" = "$OK" ]; then
            echo "CN OK result"
            pass=$((pass + 1))
        else
            echo "CN Failure"
            fail=$((fail + 1))
        fi
    done
done

echo "Total processed: $processed"
echo "Total compiled: $compiled"
echo "Total CN passed: $pass"
echo "Total CN fail: $fail"