java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:24:35,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:24:35,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:24:35,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:24:35,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:24:35,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:24:35,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:24:35,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:24:35,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:24:35,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:24:35,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:24:35,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:24:35,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:24:35,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:24:35,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:24:35,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:24:35,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:24:35,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:24:35,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:24:35,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:24:35,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:24:35,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:24:35,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:24:35,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:24:35,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:24:35,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:24:35,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:24:35,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:24:35,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:24:35,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:24:35,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:24:35,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:24:35,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:24:35,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:24:35,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:24:35,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:24:35,056 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:24:35,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:24:35,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:24:35,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:24:35,080 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:24:35,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:24:35,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:24:35,081 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:24:35,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:24:35,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:24:35,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:24:35,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:24:35,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:24:35,083 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:24:35,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:24:35,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:24:35,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:24:35,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:24:35,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:24:35,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:24:35,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:24:35,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:24:35,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:24:35,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:24:35,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:24:35,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:24:35,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:24:35,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:24:35,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:24:35,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:24:35,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:24:35,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:35,227 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13894d635/fbc7096eaa0443c38c37ea41e8c6a83a/FLAG83b29266a [2018-11-14 17:24:35,800 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:24:35,801 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:35,825 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13894d635/fbc7096eaa0443c38c37ea41e8c6a83a/FLAG83b29266a [2018-11-14 17:24:35,839 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13894d635/fbc7096eaa0443c38c37ea41e8c6a83a [2018-11-14 17:24:35,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:24:35,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:24:35,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:35,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:24:35,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:24:35,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:35" (1/1) ... [2018-11-14 17:24:35,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7fa90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:35, skipping insertion in model container [2018-11-14 17:24:35,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:35" (1/1) ... [2018-11-14 17:24:35,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:24:35,931 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:24:36,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:36,327 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:24:36,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:36,535 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:24:36,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36 WrapperNode [2018-11-14 17:24:36,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:36,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:24:36,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:24:36,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:24:36,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... [2018-11-14 17:24:36,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:24:36,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:24:36,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:24:36,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:24:36,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 17:24:36,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:24:36,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:24:36,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:24:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:24:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:24:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:24:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:24:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:24:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:24:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:24:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:24:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:24:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:24:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:24:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:24:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:24:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:24:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:24:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:24:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:24:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:24:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:24:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:24:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:24:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:24:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:24:36,749 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:24:36,750 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:24:36,750 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:24:36,750 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:24:36,750 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:24:36,750 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:24:36,751 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:24:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:24:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:24:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:24:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:24:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:24:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:24:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:24:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:24:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:24:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:24:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:24:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:24:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:24:37,863 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:24:37,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:37 BoogieIcfgContainer [2018-11-14 17:24:37,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:24:37,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:24:37,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:24:37,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:24:37,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:35" (1/3) ... [2018-11-14 17:24:37,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32587c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:37, skipping insertion in model container [2018-11-14 17:24:37,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:36" (2/3) ... [2018-11-14 17:24:37,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32587c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:37, skipping insertion in model container [2018-11-14 17:24:37,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:37" (3/3) ... [2018-11-14 17:24:37,873 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:37,881 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:24:37,889 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-14 17:24:37,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-14 17:24:37,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:24:37,949 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:24:37,949 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:24:37,949 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:24:37,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:24:37,950 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:24:37,950 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:24:37,950 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:24:37,950 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:24:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-14 17:24:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:24:37,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:37,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:37,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:37,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1661948617, now seen corresponding path program 1 times [2018-11-14 17:24:37,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:37,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:38,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2018-11-14 17:24:38,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46#true} is VALID [2018-11-14 17:24:38,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:24:38,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #145#return; {46#true} is VALID [2018-11-14 17:24:38,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret16 := main(); {46#true} is VALID [2018-11-14 17:24:38,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {46#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {46#true} is VALID [2018-11-14 17:24:38,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {46#true} assume !true; {47#false} is VALID [2018-11-14 17:24:38,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#false} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {47#false} is VALID [2018-11-14 17:24:38,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {47#false} assume true; {47#false} is VALID [2018-11-14 17:24:38,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {47#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {47#false} is VALID [2018-11-14 17:24:38,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#false} assume !false; {47#false} is VALID [2018-11-14 17:24:38,208 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-14 17:24:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:38,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:24:38,217 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:38,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:38,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:24:38,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:38,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:24:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:24:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:24:38,325 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-14 17:24:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:38,468 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2018-11-14 17:24:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:24:38,469 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-14 17:24:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-14 17:24:38,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-14 17:24:39,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:39,103 INFO L225 Difference]: With dead ends: 76 [2018-11-14 17:24:39,103 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:24:39,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:24:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:24:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 17:24:39,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:39,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 17:24:39,226 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:24:39,226 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:24:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:39,232 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:24:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:24:39,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:39,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:39,233 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:24:39,234 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:24:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:39,239 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:24:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:24:39,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:39,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:39,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:39,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:24:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 17:24:39,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 11 [2018-11-14 17:24:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 17:24:39,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:24:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:24:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:24:39,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:39,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:39,252 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:39,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1467291523, now seen corresponding path program 1 times [2018-11-14 17:24:39,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:39,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:39,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:39,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:39,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-14 17:24:39,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {247#true} is VALID [2018-11-14 17:24:39,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 17:24:39,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #145#return; {247#true} is VALID [2018-11-14 17:24:39,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret16 := main(); {247#true} is VALID [2018-11-14 17:24:39,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {249#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:39,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {249#(not (= 0 main_~list~0.base))} assume true; {249#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:39,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:39,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(not (= 0 main_~list~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {249#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:39,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {249#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {250#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 17:24:39,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {250#(not (= 0 main_~end~0.base))} assume true; {250#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 17:24:39,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {250#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {248#false} is VALID [2018-11-14 17:24:39,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-14 17:24:39,656 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-14 17:24:39,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:39,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:39,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:39,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:39,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:39,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:39,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:39,751 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-11-14 17:24:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:40,119 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:24:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:40,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-14 17:24:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-14 17:24:40,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-14 17:24:40,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:40,250 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:24:40,250 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:24:40,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:24:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-14 17:24:40,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:40,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-14 17:24:40,264 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-14 17:24:40,264 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-14 17:24:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:40,268 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:24:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:24:40,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:40,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:40,269 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-14 17:24:40,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-14 17:24:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:40,274 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:24:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:24:40,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:40,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:40,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:40,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:24:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 17:24:40,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2018-11-14 17:24:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:40,279 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 17:24:40,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:24:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:24:40,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:40,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:40,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:40,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2099325391, now seen corresponding path program 1 times [2018-11-14 17:24:40,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:40,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:40,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2018-11-14 17:24:40,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {415#true} is VALID [2018-11-14 17:24:40,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2018-11-14 17:24:40,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #145#return; {415#true} is VALID [2018-11-14 17:24:40,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret16 := main(); {415#true} is VALID [2018-11-14 17:24:40,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {415#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:40,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume true; {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:40,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:40,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:40,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {417#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:40,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume true; {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:40,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:40,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume true; {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:40,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {418#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {419#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 17:24:40,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {419#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {416#false} is VALID [2018-11-14 17:24:40,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {416#false} assume !false; {416#false} is VALID [2018-11-14 17:24:40,571 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-14 17:24:40,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:40,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:24:40,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:24:40,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:40,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:40,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:40,635 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-14 17:24:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:41,226 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 17:24:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:24:41,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:24:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:24:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:24:41,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-14 17:24:41,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:41,382 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:24:41,383 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 17:24:41,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:24:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 17:24:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-14 17:24:41,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:41,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 43 states. [2018-11-14 17:24:41,457 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 43 states. [2018-11-14 17:24:41,457 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 43 states. [2018-11-14 17:24:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:41,461 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-14 17:24:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-14 17:24:41,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:41,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:41,463 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 62 states. [2018-11-14 17:24:41,463 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 62 states. [2018-11-14 17:24:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:41,467 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-14 17:24:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-14 17:24:41,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:41,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:41,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:41,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:24:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 17:24:41,472 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 16 [2018-11-14 17:24:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:41,472 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 17:24:41,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:24:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:24:41,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:41,474 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:41,474 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:41,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2081243530, now seen corresponding path program 1 times [2018-11-14 17:24:41,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:41,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:41,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 17:24:41,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 17:24:41,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 17:24:41,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #145#return; {676#true} is VALID [2018-11-14 17:24:41,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret16 := main(); {676#true} is VALID [2018-11-14 17:24:41,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:41,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume true; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:41,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:41,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {679#(and (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~RED)) main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:41,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(and (= ~unnamed1~0~BLACK (select (select (store |#memory_int| main_~end~0.base (store (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4) ~unnamed1~0~RED)) main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume !(#t~nondet4 != 0);havoc #t~nondet4;call write~int(~unnamed1~0~RED, ~end~0.base, ~end~0.offset + 4, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, ~end~0.offset + 4, 4); {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:41,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume true; {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:41,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:41,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:41,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2018-11-14 17:24:41,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} assume true; {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2018-11-14 17:24:41,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2018-11-14 17:24:41,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} assume true; {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2018-11-14 17:24:41,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {681#(and (= main_~end~0.offset 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))))} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {682#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 17:24:41,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {682#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {677#false} is VALID [2018-11-14 17:24:41,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 17:24:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:24:41,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:24:41,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:24:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:41,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:24:42,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 17:24:42,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 17:24:42,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 17:24:42,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,074 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-14 17:24:42,078 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:24:42,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:24:42,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:24:42,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-14 17:24:42,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-14 17:24:42,277 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:24:42,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:24:42,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:24:42,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:24:42,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 17:24:42,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-14 17:24:42,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 17:24:42,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-14 17:24:42,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 17:24:42,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:42,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-14 17:24:42,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:65, output treesize:43 [2018-11-14 17:24:42,632 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:24:43,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-14 17:24:43,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:24:43,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:43,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 17:24:43,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:43,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 17:24:43,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:43,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:43,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:43,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-14 17:24:43,271 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:24:43,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 17:24:43,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 17:24:43,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 17:24:43,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #145#return; {676#true} is VALID [2018-11-14 17:24:43,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret16 := main(); {676#true} is VALID [2018-11-14 17:24:43,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:43,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume true; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:43,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} is VALID [2018-11-14 17:24:43,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {678#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {710#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2018-11-14 17:24:43,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base main_~end~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !(#t~nondet4 != 0);havoc #t~nondet4;call write~int(~unnamed1~0~RED, ~end~0.base, ~end~0.offset + 4, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, ~end~0.offset + 4, 4); {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:43,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume true; {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:43,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:43,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2018-11-14 17:24:43,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {714#(and (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~list~0.base)))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2018-11-14 17:24:43,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume true; {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2018-11-14 17:24:43,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2018-11-14 17:24:43,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume true; {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} is VALID [2018-11-14 17:24:43,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {727#(and (= main_~end~0.offset 0) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (v_subst_1 Int)) (and (= (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4)) ~unnamed1~0~RED) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_subst_1 4))))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK))} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {682#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2018-11-14 17:24:43,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {682#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {677#false} is VALID [2018-11-14 17:24:43,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 17:24:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:24:43,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:24:43,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-14 17:24:43,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 17:24:43,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:43,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:24:43,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:43,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:24:43,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:24:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:24:43,438 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-11-14 17:24:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:45,758 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-14 17:24:45,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:24:45,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 17:24:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:24:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2018-11-14 17:24:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:24:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2018-11-14 17:24:45,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2018-11-14 17:24:46,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:46,005 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:24:46,006 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:24:46,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:24:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:24:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 31. [2018-11-14 17:24:46,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:46,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 31 states. [2018-11-14 17:24:46,065 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 31 states. [2018-11-14 17:24:46,066 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 31 states. [2018-11-14 17:24:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:46,069 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-14 17:24:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-11-14 17:24:46,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:46,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:46,071 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 78 states. [2018-11-14 17:24:46,071 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 78 states. [2018-11-14 17:24:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:46,075 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-14 17:24:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-11-14 17:24:46,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:46,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:46,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:46,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:24:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 17:24:46,079 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-11-14 17:24:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:46,079 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 17:24:46,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:24:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 17:24:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:24:46,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:46,081 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] [2018-11-14 17:24:46,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:46,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1966146467, now seen corresponding path program 1 times [2018-11-14 17:24:46,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:46,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {1046#true} call ULTIMATE.init(); {1046#true} is VALID [2018-11-14 17:24:46,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1046#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1046#true} is VALID [2018-11-14 17:24:46,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {1046#true} assume true; {1046#true} is VALID [2018-11-14 17:24:46,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1046#true} {1046#true} #145#return; {1046#true} is VALID [2018-11-14 17:24:46,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {1046#true} call #t~ret16 := main(); {1046#true} is VALID [2018-11-14 17:24:46,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {1046#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1046#true} is VALID [2018-11-14 17:24:46,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {1046#true} assume true; {1046#true} is VALID [2018-11-14 17:24:46,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {1046#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1046#true} is VALID [2018-11-14 17:24:46,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {1046#true} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1046#true} is VALID [2018-11-14 17:24:46,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {1046#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1046#true} is VALID [2018-11-14 17:24:46,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {1046#true} assume true; {1046#true} is VALID [2018-11-14 17:24:46,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {1046#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {1046#true} is VALID [2018-11-14 17:24:46,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {1046#true} assume true; {1046#true} is VALID [2018-11-14 17:24:46,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {1046#true} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1048#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:46,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {1048#(= |main_#t~mem7| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:46,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume true; {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:46,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume true; {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} is VALID [2018-11-14 17:24:46,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1050#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2018-11-14 17:24:46,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {1050#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1047#false} is VALID [2018-11-14 17:24:46,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#false} assume true; {1047#false} is VALID [2018-11-14 17:24:46,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {1047#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1047#false} is VALID [2018-11-14 17:24:46,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {1047#false} assume !false; {1047#false} is VALID [2018-11-14 17:24:46,299 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-14 17:24:46,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:46,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:24:46,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:24:46,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:46,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:46,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:46,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:46,368 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-14 17:24:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:46,634 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 17:24:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:24:46,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:24:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 17:24:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 17:24:46,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-14 17:24:46,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:46,727 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:24:46,727 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:24:46,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:24:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:24:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-14 17:24:46,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:46,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-14 17:24:46,777 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-14 17:24:46,777 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-14 17:24:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:46,779 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:24:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:24:46,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:46,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:46,780 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-14 17:24:46,780 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-14 17:24:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:46,782 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:24:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:24:46,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:46,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:46,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:46,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:24:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 17:24:46,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2018-11-14 17:24:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:46,785 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 17:24:46,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 17:24:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:24:46,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:46,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:46,786 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:46,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash -294845851, now seen corresponding path program 1 times [2018-11-14 17:24:46,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:46,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:46,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:46,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {1223#true} call ULTIMATE.init(); {1223#true} is VALID [2018-11-14 17:24:46,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {1223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1223#true} is VALID [2018-11-14 17:24:46,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 17:24:46,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1223#true} {1223#true} #145#return; {1223#true} is VALID [2018-11-14 17:24:46,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {1223#true} call #t~ret16 := main(); {1223#true} is VALID [2018-11-14 17:24:46,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {1223#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:46,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume true; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:46,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:46,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:46,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:46,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:46,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} assume true; {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:46,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1224#false} is VALID [2018-11-14 17:24:46,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {1224#false} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1224#false} is VALID [2018-11-14 17:24:46,971 INFO L273 TraceCheckUtils]: 23: Hoare triple {1224#false} assume true; {1224#false} is VALID [2018-11-14 17:24:46,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {1224#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1224#false} is VALID [2018-11-14 17:24:46,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {1224#false} assume !false; {1224#false} is VALID [2018-11-14 17:24:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:24:46,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:24:46,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:24:46,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:47,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:24:47,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:24:47,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:24:47,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:24:47,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:24:47,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-14 17:24:47,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:24:47,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:24:47,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:24:47,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:24:47,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:24:47,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-14 17:24:47,186 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:24:47,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {1223#true} call ULTIMATE.init(); {1223#true} is VALID [2018-11-14 17:24:47,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {1223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1223#true} is VALID [2018-11-14 17:24:47,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {1223#true} assume true; {1223#true} is VALID [2018-11-14 17:24:47,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1223#true} {1223#true} #145#return; {1223#true} is VALID [2018-11-14 17:24:47,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {1223#true} call #t~ret16 := main(); {1223#true} is VALID [2018-11-14 17:24:47,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {1223#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, ~list~0.offset + 4, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:47,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume true; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:47,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:47,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 17:24:47,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {1225#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem7 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 17:24:47,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:47,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} assume true; {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:47,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, ~end~0.offset + 4, 4); {1224#false} is VALID [2018-11-14 17:24:47,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1224#false} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1224#false} is VALID [2018-11-14 17:24:47,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {1224#false} assume true; {1224#false} is VALID [2018-11-14 17:24:47,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {1224#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1224#false} is VALID [2018-11-14 17:24:47,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {1224#false} assume !false; {1224#false} is VALID [2018-11-14 17:24:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:24:47,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:24:47,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-14 17:24:47,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:24:47,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:47,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:47,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:47,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:47,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:47,323 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-14 17:24:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:47,968 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-14 17:24:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:24:47,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:24:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:24:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:24:47,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 17:24:48,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:48,059 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:24:48,059 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:24:48,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:24:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:24:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:24:48,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:48,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:24:48,124 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:24:48,124 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:24:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:48,126 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 17:24:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 17:24:48,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:48,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:48,127 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:24:48,127 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:24:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:48,128 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 17:24:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 17:24:48,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:48,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:48,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:48,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:24:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-14 17:24:48,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 26 [2018-11-14 17:24:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:48,131 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-14 17:24:48,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 17:24:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:24:48,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:48,132 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:48,133 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:48,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1554757814, now seen corresponding path program 1 times [2018-11-14 17:24:48,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:48,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:48,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:48,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:48,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:48,443 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:24:48,449 INFO L168 Benchmark]: Toolchain (without parser) took 12599.81 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 869.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -702.8 MB). Peak memory consumption was 166.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:48,451 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:24:48,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:48,452 INFO L168 Benchmark]: Boogie Preprocessor took 135.18 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:24:48,453 INFO L168 Benchmark]: RCFGBuilder took 1191.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:48,453 INFO L168 Benchmark]: TraceAbstraction took 10582.37 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 143.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.4 MB). Peak memory consumption was 142.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:48,457 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 685.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.18 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1191.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10582.37 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 143.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.4 MB). Peak memory consumption was 142.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...