./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:25:23,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:25:23,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:25:23,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:25:23,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:25:23,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:25:23,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:25:23,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:25:23,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:25:23,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:25:23,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:25:23,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:25:23,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:25:23,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:25:23,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:25:23,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:25:23,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:25:23,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:25:23,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:25:23,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:25:23,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:25:23,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:25:23,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:25:23,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:25:23,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:25:23,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:25:23,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:25:23,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:25:23,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:25:23,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:25:23,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:25:23,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:25:23,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:25:23,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:25:23,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:25:23,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:25:23,918 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 13:25:23,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:25:23,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:25:23,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:25:23,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:25:23,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:25:23,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:25:23,930 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:25:23,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:25:23,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:25:23,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:25:23,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:25:23,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:25:23,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:25:23,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:25:23,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:25:23,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:25:23,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:25:23,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:25:23,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:25:23,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:25:23,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:25:23,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:25:23,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:25:23,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:25:23,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2018-11-10 13:25:23,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:25:23,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:25:23,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:25:23,975 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:25:23,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:25:23,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-10 13:25:24,021 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/data/bf348e2b8/8bc3677a23514448add6ac53f1563cab/FLAG2fe93a430 [2018-11-10 13:25:24,405 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:25:24,405 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-10 13:25:24,414 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/data/bf348e2b8/8bc3677a23514448add6ac53f1563cab/FLAG2fe93a430 [2018-11-10 13:25:24,424 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/data/bf348e2b8/8bc3677a23514448add6ac53f1563cab [2018-11-10 13:25:24,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:25:24,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 13:25:24,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:25:24,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:25:24,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:25:24,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e93ce52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24, skipping insertion in model container [2018-11-10 13:25:24,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:25:24,475 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:25:24,685 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:25:24,690 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:25:24,724 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:25:24,752 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:25:24,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24 WrapperNode [2018-11-10 13:25:24,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:25:24,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:25:24,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:25:24,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:25:24,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... [2018-11-10 13:25:24,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:25:24,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:25:24,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:25:24,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:25:24,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:25:24,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:25:24,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:25:24,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:25:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 13:25:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 13:25:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 13:25:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 13:25:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 13:25:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 13:25:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 13:25:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 13:25:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 13:25:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 13:25:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 13:25:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 13:25:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 13:25:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 13:25:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:25:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:25:25,376 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:25:25,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:25 BoogieIcfgContainer [2018-11-10 13:25:25,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:25:25,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:25:25,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:25:25,380 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:25:25,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:25:24" (1/3) ... [2018-11-10 13:25:25,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b1066b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:25:25, skipping insertion in model container [2018-11-10 13:25:25,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:25:24" (2/3) ... [2018-11-10 13:25:25,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b1066b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:25:25, skipping insertion in model container [2018-11-10 13:25:25,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:25" (3/3) ... [2018-11-10 13:25:25,383 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-10 13:25:25,391 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:25:25,397 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-10 13:25:25,405 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-10 13:25:25,423 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:25:25,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:25:25,423 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:25:25,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:25:25,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:25:25,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:25:25,423 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:25:25,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:25:25,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:25:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-11-10 13:25:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 13:25:25,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:25,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:25,445 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:25,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash -914145134, now seen corresponding path program 1 times [2018-11-10 13:25:25,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:25,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:25,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:25:25,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:25:25,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:25:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:25:25,576 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-11-10 13:25:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:25,665 INFO L93 Difference]: Finished difference Result 317 states and 433 transitions. [2018-11-10 13:25:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:25:25,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 13:25:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:25,676 INFO L225 Difference]: With dead ends: 317 [2018-11-10 13:25:25,676 INFO L226 Difference]: Without dead ends: 171 [2018-11-10 13:25:25,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-10 13:25:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2018-11-10 13:25:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 13:25:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-11-10 13:25:25,713 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 12 [2018-11-10 13:25:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:25,714 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-11-10 13:25:25,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:25:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-11-10 13:25:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:25:25,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:25,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:25,715 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:25,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1035040939, now seen corresponding path program 1 times [2018-11-10 13:25:25,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:25,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:25,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:25,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:25:25,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:25:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:25:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:25,750 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 3 states. [2018-11-10 13:25:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:25,780 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-10 13:25:25,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:25:25,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 13:25:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:25,781 INFO L225 Difference]: With dead ends: 146 [2018-11-10 13:25:25,781 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 13:25:25,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 13:25:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-10 13:25:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 13:25:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-11-10 13:25:25,790 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 21 [2018-11-10 13:25:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:25,790 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-11-10 13:25:25,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:25:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-10 13:25:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:25:25,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:25,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:25,792 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:25,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1756375186, now seen corresponding path program 1 times [2018-11-10 13:25:25,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:25,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:25,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:25,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:25,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:25:25,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:25:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:25:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:25:25,909 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 7 states. [2018-11-10 13:25:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:26,119 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-11-10 13:25:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:25:26,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-10 13:25:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:26,120 INFO L225 Difference]: With dead ends: 223 [2018-11-10 13:25:26,120 INFO L226 Difference]: Without dead ends: 221 [2018-11-10 13:25:26,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:25:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-10 13:25:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 141. [2018-11-10 13:25:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 13:25:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-11-10 13:25:26,128 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 23 [2018-11-10 13:25:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:26,128 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-11-10 13:25:26,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:25:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-11-10 13:25:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:25:26,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:26,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:26,130 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:26,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -797219430, now seen corresponding path program 1 times [2018-11-10 13:25:26,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:26,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:26,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:25:26,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:26,179 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 5 states. [2018-11-10 13:25:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:26,326 INFO L93 Difference]: Finished difference Result 334 states and 356 transitions. [2018-11-10 13:25:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:26,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-10 13:25:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:26,328 INFO L225 Difference]: With dead ends: 334 [2018-11-10 13:25:26,328 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 13:25:26,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:25:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 13:25:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 145. [2018-11-10 13:25:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 13:25:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-10 13:25:26,334 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 29 [2018-11-10 13:25:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:26,335 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-10 13:25:26,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-10 13:25:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 13:25:26,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:26,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:26,336 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:26,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1124314787, now seen corresponding path program 1 times [2018-11-10 13:25:26,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:26,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:26,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:26,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:25:26,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:25:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:25:26,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:25:26,370 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 5 states. [2018-11-10 13:25:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:26,441 INFO L93 Difference]: Finished difference Result 245 states and 260 transitions. [2018-11-10 13:25:26,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:25:26,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-10 13:25:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:26,443 INFO L225 Difference]: With dead ends: 245 [2018-11-10 13:25:26,443 INFO L226 Difference]: Without dead ends: 215 [2018-11-10 13:25:26,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:25:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-10 13:25:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 145. [2018-11-10 13:25:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 13:25:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-10 13:25:26,450 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 31 [2018-11-10 13:25:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:26,451 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-10 13:25:26,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:25:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-10 13:25:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 13:25:26,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:26,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:26,452 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:26,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1286847425, now seen corresponding path program 1 times [2018-11-10 13:25:26,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:26,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:26,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:26,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 13:25:26,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:25:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:25:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:25:26,553 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 11 states. [2018-11-10 13:25:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:26,867 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2018-11-10 13:25:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:25:26,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-10 13:25:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:26,869 INFO L225 Difference]: With dead ends: 256 [2018-11-10 13:25:26,869 INFO L226 Difference]: Without dead ends: 252 [2018-11-10 13:25:26,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:25:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-10 13:25:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 161. [2018-11-10 13:25:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 13:25:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2018-11-10 13:25:26,880 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 38 [2018-11-10 13:25:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:26,880 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2018-11-10 13:25:26,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:25:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2018-11-10 13:25:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 13:25:26,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:26,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:26,882 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:26,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash -264906566, now seen corresponding path program 1 times [2018-11-10 13:25:26,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:26,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:26,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:26,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:26,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:25:26,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:25:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:25:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:26,917 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 3 states. [2018-11-10 13:25:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:26,932 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-11-10 13:25:26,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:25:26,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 13:25:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:26,933 INFO L225 Difference]: With dead ends: 260 [2018-11-10 13:25:26,934 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 13:25:26,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 13:25:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2018-11-10 13:25:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 13:25:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-11-10 13:25:26,939 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 40 [2018-11-10 13:25:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:26,939 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-11-10 13:25:26,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:25:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-11-10 13:25:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 13:25:26,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:26,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:26,941 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:26,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash 377526548, now seen corresponding path program 1 times [2018-11-10 13:25:26,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:26,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:25:26,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:25:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:25:26,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:26,977 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 3 states. [2018-11-10 13:25:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:27,004 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-11-10 13:25:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:25:27,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-10 13:25:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:27,006 INFO L225 Difference]: With dead ends: 166 [2018-11-10 13:25:27,006 INFO L226 Difference]: Without dead ends: 164 [2018-11-10 13:25:27,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-10 13:25:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-11-10 13:25:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-10 13:25:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-11-10 13:25:27,011 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 41 [2018-11-10 13:25:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:27,011 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-11-10 13:25:27,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:25:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-11-10 13:25:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 13:25:27,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:27,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:27,013 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:27,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1263534105, now seen corresponding path program 1 times [2018-11-10 13:25:27,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:27,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:27,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 13:25:27,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:25:27,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:25:27,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:25:27,170 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 10 states. [2018-11-10 13:25:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:27,531 INFO L93 Difference]: Finished difference Result 347 states and 371 transitions. [2018-11-10 13:25:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:25:27,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-10 13:25:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:27,532 INFO L225 Difference]: With dead ends: 347 [2018-11-10 13:25:27,532 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 13:25:27,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:25:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 13:25:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 180. [2018-11-10 13:25:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 13:25:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-11-10 13:25:27,540 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 45 [2018-11-10 13:25:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:27,540 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-11-10 13:25:27,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:25:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-11-10 13:25:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 13:25:27,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:27,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:27,542 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:27,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -759830865, now seen corresponding path program 1 times [2018-11-10 13:25:27,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:27,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 13:25:27,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:25:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:25:27,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:25:27,889 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 13 states. [2018-11-10 13:25:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:28,875 INFO L93 Difference]: Finished difference Result 542 states and 575 transitions. [2018-11-10 13:25:28,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 13:25:28,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-10 13:25:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:28,877 INFO L225 Difference]: With dead ends: 542 [2018-11-10 13:25:28,877 INFO L226 Difference]: Without dead ends: 540 [2018-11-10 13:25:28,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:25:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-10 13:25:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 197. [2018-11-10 13:25:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 13:25:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2018-11-10 13:25:28,889 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 50 [2018-11-10 13:25:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:28,889 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2018-11-10 13:25:28,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:25:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2018-11-10 13:25:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 13:25:28,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:28,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:28,891 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:28,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -398513865, now seen corresponding path program 1 times [2018-11-10 13:25:28,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:28,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:28,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:25:28,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:25:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:25:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:28,921 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand 3 states. [2018-11-10 13:25:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:28,933 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2018-11-10 13:25:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:25:28,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 13:25:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:28,934 INFO L225 Difference]: With dead ends: 200 [2018-11-10 13:25:28,935 INFO L226 Difference]: Without dead ends: 198 [2018-11-10 13:25:28,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:25:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-10 13:25:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-10 13:25:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-10 13:25:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 211 transitions. [2018-11-10 13:25:28,946 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 211 transitions. Word has length 50 [2018-11-10 13:25:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:28,947 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 211 transitions. [2018-11-10 13:25:28,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:25:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 211 transitions. [2018-11-10 13:25:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 13:25:28,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:28,948 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:28,949 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:28,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1248547022, now seen corresponding path program 1 times [2018-11-10 13:25:28,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:28,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:25:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:25:29,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:25:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:25:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:25:29,032 INFO L87 Difference]: Start difference. First operand 198 states and 211 transitions. Second operand 7 states. [2018-11-10 13:25:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:29,228 INFO L93 Difference]: Finished difference Result 277 states and 296 transitions. [2018-11-10 13:25:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:25:29,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-10 13:25:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:29,230 INFO L225 Difference]: With dead ends: 277 [2018-11-10 13:25:29,230 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 13:25:29,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:25:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 13:25:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2018-11-10 13:25:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 13:25:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-11-10 13:25:29,245 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 52 [2018-11-10 13:25:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:29,245 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-11-10 13:25:29,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:25:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-11-10 13:25:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 13:25:29,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:29,246 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:29,246 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:29,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash -718036486, now seen corresponding path program 1 times [2018-11-10 13:25:29,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:29,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:29,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:29,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:25:29,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:29,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:25:29,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:25:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:25:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:25:29,305 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 7 states. [2018-11-10 13:25:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:29,474 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2018-11-10 13:25:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:25:29,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-10 13:25:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:29,476 INFO L225 Difference]: With dead ends: 247 [2018-11-10 13:25:29,476 INFO L226 Difference]: Without dead ends: 245 [2018-11-10 13:25:29,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:25:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-10 13:25:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 230. [2018-11-10 13:25:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 13:25:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 250 transitions. [2018-11-10 13:25:29,483 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 250 transitions. Word has length 52 [2018-11-10 13:25:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:29,484 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 250 transitions. [2018-11-10 13:25:29,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:25:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 250 transitions. [2018-11-10 13:25:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 13:25:29,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:29,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:29,485 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:29,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:29,485 INFO L82 PathProgramCache]: Analyzing trace with hash 715681076, now seen corresponding path program 1 times [2018-11-10 13:25:29,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:25:29,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:25:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:29,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:25:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:25:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:25:29,522 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:25:29,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:25:29 BoogieIcfgContainer [2018-11-10 13:25:29,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:25:29,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:25:29,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:25:29,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:25:29,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:25:25" (3/4) ... [2018-11-10 13:25:29,561 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:25:29,603 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25f550c1-c217-4b9e-99bf-c05edda8c611/bin-2019/uautomizer/witness.graphml [2018-11-10 13:25:29,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:25:29,604 INFO L168 Benchmark]: Toolchain (without parser) took 5177.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:25:29,606 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:25:29,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:25:29,606 INFO L168 Benchmark]: Boogie Preprocessor took 101.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 931.2 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:25:29,607 INFO L168 Benchmark]: RCFGBuilder took 522.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:25:29,607 INFO L168 Benchmark]: TraceAbstraction took 4177.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.8 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:25:29,607 INFO L168 Benchmark]: Witness Printer took 47.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:25:29,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 931.2 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 522.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4177.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.8 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. * Witness Printer took 47.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={15:0}] [L992] SLL* list = malloc(sizeof(SLL)); VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L993] FCALL list->next = ((void*)0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L994] FCALL list->prev = ((void*)0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L995] COND FALSE !(0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={15:0}, list->inner={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] FCALL list->inner->next = ((void*)0) VAL [list={15:0}, list->inner={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={15:0}, list->inner={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] FCALL list->inner->inner = ((void*)0) VAL [list={15:0}, list->inner={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={15:0}, list->inner={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={15:0}, list->inner={14:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] COND FALSE !(0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L997] SLL* end = list; VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; VAL [end={15:0}, len=0, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1020] EXPR, FCALL end->inner VAL [end={15:0}, end->inner={14:0}, len=0, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={15:0}, inner={14:0}, len=0, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={15:0}, inner={14:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={15:0}, inner={14:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(0) VAL [end={15:0}, inner={14:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1028] EXPR, FCALL inner->inner VAL [end={15:0}, inner={14:0}, inner->inner={0:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1028] COND FALSE !(0) VAL [end={15:0}, inner={14:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1029] EXPR, FCALL inner->next VAL [end={15:0}, inner={14:0}, inner->next={0:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={15:0}, inner={14:0}, len=1, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 150 locations, 13 error locations. UNSAFE Result, 4.1s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1864 SDtfs, 3379 SDslu, 5313 SDs, 0 SdLazy, 1991 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 856 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 538 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 137568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...