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/heap-data/shared_mem2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:28:18,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:28:18,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:28:18,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:28:18,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:28:18,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:28:18,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:28:18,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:28:18,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:28:18,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:28:18,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:28:18,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:28:18,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:28:18,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:28:18,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:28:18,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:28:18,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:28:18,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:28:18,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:28:18,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:28:18,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:28:18,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:28:18,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:28:18,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:28:18,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:28:18,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:28:18,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:28:18,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:28:18,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:28:18,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:28:18,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:28:18,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:28:18,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:28:18,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:28:18,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:28:18,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:28:18,613 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:28:18,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:28:18,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:28:18,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:28:18,631 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:28:18,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:28:18,632 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:28:18,632 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:28:18,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:28:18,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:28:18,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:28:18,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:28:18,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:28:18,633 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:28:18,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:28:18,634 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:28:18,634 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:28:18,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:28:18,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:28:18,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:28:18,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:28:18,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:28:18,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:28:18,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:28:18,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:28:18,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:28:18,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:28:18,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:28:18,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:28:18,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:28:18,706 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:28:18,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-14 17:28:18,766 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1805141/11005210279b4db8bd82c2936dba4384/FLAG2ac28b894 [2018-11-14 17:28:19,347 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:28:19,351 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-14 17:28:19,365 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1805141/11005210279b4db8bd82c2936dba4384/FLAG2ac28b894 [2018-11-14 17:28:19,391 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1805141/11005210279b4db8bd82c2936dba4384 [2018-11-14 17:28:19,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:28:19,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:28:19,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:19,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:28:19,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:28:19,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:19" (1/1) ... [2018-11-14 17:28:19,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64131d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:19, skipping insertion in model container [2018-11-14 17:28:19,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:19" (1/1) ... [2018-11-14 17:28:19,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:28:19,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:28:19,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:19,924 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:28:20,007 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:20,072 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:28:20,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20 WrapperNode [2018-11-14 17:28:20,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:20,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:28:20,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:28:20,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:28:20,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (1/1) ... [2018-11-14 17:28:20,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:28:20,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:28:20,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:28:20,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:28:20,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (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:28:20,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:28:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:28:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:28:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:28:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:28:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:28:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:28:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:28:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:28:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:28:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:28:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:28:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:28:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:28:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:28:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:28:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:28:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:28:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:28:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:28:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:28:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:28:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:28:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:28:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:28:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:28:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:28:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:28:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:28:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:28:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:28:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:28:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:28:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:28:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:28:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:28:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:28:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:28:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:28:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:28:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:28:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:28:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:28:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:28:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:28:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:28:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:28:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:28:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:28:21,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:28:21,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:21 BoogieIcfgContainer [2018-11-14 17:28:21,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:28:21,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:28:21,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:28:21,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:28:21,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:28:19" (1/3) ... [2018-11-14 17:28:21,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb4b166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:21, skipping insertion in model container [2018-11-14 17:28:21,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:20" (2/3) ... [2018-11-14 17:28:21,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb4b166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:21, skipping insertion in model container [2018-11-14 17:28:21,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:21" (3/3) ... [2018-11-14 17:28:21,161 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-14 17:28:21,171 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:28:21,179 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:28:21,193 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:28:21,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:28:21,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:28:21,226 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:28:21,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:28:21,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:28:21,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:28:21,226 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:28:21,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:28:21,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:28:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-14 17:28:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:28:21,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:21,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:21,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:21,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:21,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1134505898, now seen corresponding path program 1 times [2018-11-14 17:28:21,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:21,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-14 17:28:21,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-14 17:28:21,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-14 17:28:21,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #63#return; {27#true} is VALID [2018-11-14 17:28:21,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret16 := main(); {27#true} is VALID [2018-11-14 17:28:21,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {27#true} is VALID [2018-11-14 17:28:21,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-14 17:28:21,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {28#false} is VALID [2018-11-14 17:28:21,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2018-11-14 17:28:21,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {28#false} is VALID [2018-11-14 17:28:21,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !(#t~mem15 == 100);havoc #t~mem15; {28#false} is VALID [2018-11-14 17:28:21,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-14 17:28:21,438 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:28:21,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:21,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:28:21,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 17:28:21,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:21,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:28:21,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:21,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:28:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:28:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:28:21,602 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-14 17:28:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:22,006 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-14 17:28:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:28:22,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 17:28:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-14 17:28:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-14 17:28:22,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-14 17:28:22,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:22,164 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:28:22,164 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:28:22,168 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:28:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:28:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:28:22,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:22,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:28:22,215 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:28:22,215 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:28:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:22,219 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-14 17:28:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-14 17:28:22,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:22,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:22,220 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:28:22,220 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:28:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:22,224 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-14 17:28:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-14 17:28:22,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:22,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:22,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:22,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:28:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-14 17:28:22,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2018-11-14 17:28:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:22,230 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-14 17:28:22,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:28:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-14 17:28:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:28:22,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:22,231 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:28:22,231 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:22,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1319961987, now seen corresponding path program 1 times [2018-11-14 17:28:22,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:22,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:22,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-14 17:28:22,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {142#true} is VALID [2018-11-14 17:28:22,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-14 17:28:22,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #63#return; {142#true} is VALID [2018-11-14 17:28:22,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret16 := main(); {142#true} is VALID [2018-11-14 17:28:22,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:22,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:22,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:22,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:22,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:22,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:22,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {146#(= |main_#t~mem7| 0)} is VALID [2018-11-14 17:28:22,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {146#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {143#false} is VALID [2018-11-14 17:28:22,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {143#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {143#false} is VALID [2018-11-14 17:28:22,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {143#false} assume !(#t~mem15 == 100);havoc #t~mem15; {143#false} is VALID [2018-11-14 17:28:22,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-14 17:28:22,890 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:28:22,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:22,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:28:22,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:28:22,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:22,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:28:23,020 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:28:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:28:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:28:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:28:23,022 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-14 17:28:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:23,386 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-14 17:28:23,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:28:23,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:28:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-14 17:28:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-14 17:28:23,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-14 17:28:23,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:23,469 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:28:23,469 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:28:23,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:28:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:28:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 17:28:23,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:23,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 17:28:23,501 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:28:23,501 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:28:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:23,504 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-14 17:28:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:28:23,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:23,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:23,505 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:28:23,505 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:28:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:23,508 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-14 17:28:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:28:23,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:23,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:23,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:23,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:28:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-14 17:28:23,512 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2018-11-14 17:28:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:23,513 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-14 17:28:23,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:28:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:28:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:28:23,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:23,514 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:28:23,515 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:23,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 288774952, now seen corresponding path program 1 times [2018-11-14 17:28:23,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:23,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:23,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-14 17:28:23,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-14 17:28:23,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-14 17:28:23,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #63#return; {291#true} is VALID [2018-11-14 17:28:23,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret16 := main(); {291#true} is VALID [2018-11-14 17:28:23,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:23,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:23,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:23,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:23,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~n~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~n~0.offset + 8, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~list~0.offset + 8, 4); {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-14 17:28:23,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {295#(= |main_#t~mem7| 0)} is VALID [2018-11-14 17:28:23,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {295#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {292#false} is VALID [2018-11-14 17:28:23,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {292#false} is VALID [2018-11-14 17:28:23,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume !(#t~mem15 == 100);havoc #t~mem15; {292#false} is VALID [2018-11-14 17:28:23,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-14 17:28:23,832 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:28:23,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:23,833 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:28:23,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:23,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:24,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:24,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-14 17:28:24,152 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 23 treesize of output 15 [2018-11-14 17:28:24,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 17:28:24,249 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:28:24,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 17:28:24,334 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:28:24,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,342 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:24,371 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2018-11-14 17:28:24,377 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:28:24,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:24,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:24,712 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:28:24,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,751 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 26 treesize of output 35 [2018-11-14 17:28:24,783 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:28:24,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:24,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:24,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:45, output treesize:19 [2018-11-14 17:28:24,842 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:28:25,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-14 17:28:25,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-14 17:28:25,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-14 17:28:25,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #63#return; {291#true} is VALID [2018-11-14 17:28:25,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret16 := main(); {291#true} is VALID [2018-11-14 17:28:25,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~n~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~n~0.offset + 8, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~list~0.offset + 8, 4); {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {346#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:25,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~mem7 < 100);havoc #t~mem7; {292#false} is VALID [2018-11-14 17:28:25,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {292#false} is VALID [2018-11-14 17:28:25,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume !(#t~mem15 == 100);havoc #t~mem15; {292#false} is VALID [2018-11-14 17:28:25,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-14 17:28:25,108 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:28:25,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:25,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 17:28:25,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:28:25,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:25,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:28:25,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:25,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:28:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:28:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:28:25,201 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2018-11-14 17:28:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:25,601 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 17:28:25,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:28:25,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:28:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:28:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-14 17:28:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:28:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-14 17:28:25,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-14 17:28:25,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:25,666 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:28:25,666 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:28:25,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:28:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:28:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-14 17:28:25,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:25,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2018-11-14 17:28:25,700 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2018-11-14 17:28:25,700 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2018-11-14 17:28:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:25,703 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-14 17:28:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-14 17:28:25,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:25,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:25,704 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2018-11-14 17:28:25,704 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2018-11-14 17:28:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:25,707 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-14 17:28:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-14 17:28:25,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:25,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:25,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:25,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:28:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-14 17:28:25,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2018-11-14 17:28:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:25,711 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-14 17:28:25,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:28:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 17:28:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:28:25,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:25,712 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:25,713 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:25,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1868090653, now seen corresponding path program 1 times [2018-11-14 17:28:25,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:25,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:25,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:25,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:26,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-14 17:28:26,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-14 17:28:26,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-14 17:28:26,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2018-11-14 17:28:26,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret16 := main(); {512#true} is VALID [2018-11-14 17:28:26,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset + 0, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset + 0, 4); {516#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset + 0, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset + 0, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem13; {517#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:26,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} is VALID [2018-11-14 17:28:26,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} assume true; {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} is VALID [2018-11-14 17:28:26,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {519#(<= |main_#t~mem7| 1)} is VALID [2018-11-14 17:28:26,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {519#(<= |main_#t~mem7| 1)} assume !(#t~mem7 < 100);havoc #t~mem7; {513#false} is VALID [2018-11-14 17:28:26,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {513#false} is VALID [2018-11-14 17:28:26,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {513#false} assume !(#t~mem15 == 100);havoc #t~mem15; {513#false} is VALID [2018-11-14 17:28:26,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-14 17:28:26,377 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:28:26,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:26,377 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:28:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:26,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:26,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 17:28:26,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:26,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 17:28:26,563 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:28:26,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:26,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 17:28:26,627 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:28:26,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:26,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:26,745 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:28:26,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:26,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-11-14 17:28:26,757 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:28:27,008 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 77 treesize of output 69 [2018-11-14 17:28:27,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2018-11-14 17:28:27,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:27,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:27,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 67 treesize of output 107 [2018-11-14 17:28:27,193 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-14 17:28:27,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 104 [2018-11-14 17:28:27,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-11-14 17:28:29,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2018-11-14 17:28:29,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-14 17:28:30,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 55 [2018-11-14 17:28:31,057 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:31,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 74 [2018-11-14 17:28:31,728 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-14 17:28:32,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 96 [2018-11-14 17:28:32,393 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-11-14 17:28:33,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 74 [2018-11-14 17:28:33,036 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-11-14 17:28:33,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 19 xjuncts. [2018-11-14 17:28:34,019 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 43 treesize of output 41 [2018-11-14 17:28:34,025 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-14 17:28:34,026 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,042 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,044 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 31 treesize of output 29 [2018-11-14 17:28:34,048 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-14 17:28:34,051 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,063 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,069 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 63 treesize of output 55 [2018-11-14 17:28:34,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2018-11-14 17:28:34,090 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,105 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,110 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 73 treesize of output 67 [2018-11-14 17:28:34,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-14 17:28:34,119 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,134 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-11-14 17:28:34,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-14 17:28:34,162 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,190 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,198 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 72 treesize of output 66 [2018-11-14 17:28:34,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-14 17:28:34,213 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,233 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,236 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 46 treesize of output 42 [2018-11-14 17:28:34,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 25 treesize of output 13 [2018-11-14 17:28:34,247 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,262 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,264 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 48 treesize of output 44 [2018-11-14 17:28:34,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-14 17:28:34,288 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,312 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,314 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 46 treesize of output 42 [2018-11-14 17:28:34,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-14 17:28:34,325 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,345 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-11-14 17:28:34,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-14 17:28:34,375 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,392 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,399 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 51 treesize of output 45 [2018-11-14 17:28:34,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-14 17:28:34,421 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,444 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,474 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 73 treesize of output 67 [2018-11-14 17:28:34,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-14 17:28:34,554 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,605 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,608 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 45 treesize of output 39 [2018-11-14 17:28:34,617 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 26 treesize of output 11 [2018-11-14 17:28:34,619 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,630 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,635 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 72 treesize of output 66 [2018-11-14 17:28:34,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-14 17:28:34,645 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,661 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-14 17:28:34,677 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 23 treesize of output 11 [2018-11-14 17:28:34,683 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,693 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:34,697 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 38 treesize of output 36 [2018-11-14 17:28:34,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-14 17:28:34,703 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,716 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,720 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 74 treesize of output 68 [2018-11-14 17:28:34,726 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-14 17:28:34,729 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,781 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-14 17:28:34,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-14 17:28:34,847 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,894 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,899 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 51 treesize of output 45 [2018-11-14 17:28:34,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-14 17:28:34,914 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:34,932 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:35,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 73 dim-0 vars, and 19 xjuncts. [2018-11-14 17:28:35,720 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 7 variables, input treesize:95, output treesize:721 [2018-11-14 17:28:37,742 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:28:53,227 WARN L179 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 357 DAG size of output: 76 [2018-11-14 17:28:53,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-14 17:28:53,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-14 17:28:53,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:53,959 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 5 treesize of output 1 [2018-11-14 17:28:53,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:53,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-11-14 17:28:54,034 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 44 treesize of output 37 [2018-11-14 17:28:54,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,092 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 33 treesize of output 28 [2018-11-14 17:28:54,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,131 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 28 treesize of output 19 [2018-11-14 17:28:54,139 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,173 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 36 treesize of output 29 [2018-11-14 17:28:54,177 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:54,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:54,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 23 [2018-11-14 17:28:54,222 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:28:54,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:54,296 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:97, output treesize:7 [2018-11-14 17:28:54,302 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:28:54,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-14 17:28:54,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-14 17:28:54,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-14 17:28:54,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2018-11-14 17:28:54,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret16 := main(); {512#true} is VALID [2018-11-14 17:28:54,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:54,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset + 0, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset + 0, 4); {560#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} is VALID [2018-11-14 17:28:54,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {560#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset + 0, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset + 0, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem13; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-14 17:28:54,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-14 17:28:54,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume true; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-14 17:28:54,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {574#(or (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-14 17:28:54,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#(or (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume !(#t~mem7 < 100);havoc #t~mem7; {578#(or (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))))} is VALID [2018-11-14 17:28:54,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {578#(or (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))))} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {582#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} is VALID [2018-11-14 17:28:54,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {582#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} assume !(#t~mem15 == 100);havoc #t~mem15; {513#false} is VALID [2018-11-14 17:28:54,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-14 17:28:54,365 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:28:54,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:54,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 17:28:54,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:28:54,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:54,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:28:54,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:54,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:28:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:28:54,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=136, Unknown=4, NotChecked=0, Total=182 [2018-11-14 17:28:54,595 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 14 states. [2018-11-14 17:28:55,637 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-11-14 17:28:55,986 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2018-11-14 17:28:56,310 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-11-14 17:28:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:56,884 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-14 17:28:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:28:56,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:28:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:28:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 17:28:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:28:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 17:28:56,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-14 17:28:57,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:57,078 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:28:57,078 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:28:57,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=157, Invalid=439, Unknown=4, NotChecked=0, Total=600 [2018-11-14 17:28:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:28:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-14 17:28:57,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:57,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-14 17:28:57,269 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-14 17:28:57,269 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-14 17:28:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:57,272 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-14 17:28:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-14 17:28:57,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:57,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:57,273 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-14 17:28:57,274 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-14 17:28:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:57,278 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-14 17:28:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-14 17:28:57,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:57,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:57,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:57,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:28:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-14 17:28:57,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21 [2018-11-14 17:28:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:57,283 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-14 17:28:57,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:28:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-14 17:28:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:28:57,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:57,284 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] [2018-11-14 17:28:57,284 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:57,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 557489246, now seen corresponding path program 1 times [2018-11-14 17:28:57,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:57,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:57,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:57,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2018-11-14 17:28:57,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {825#true} is VALID [2018-11-14 17:28:57,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2018-11-14 17:28:57,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #63#return; {825#true} is VALID [2018-11-14 17:28:57,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret16 := main(); {825#true} is VALID [2018-11-14 17:28:57,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:57,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:57,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:57,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:28:57,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~n~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~n~0.offset + 8, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~list~0.offset + 8, 4); {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-14 17:28:57,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume true; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-14 17:28:57,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-14 17:28:57,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-14 17:28:57,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} is VALID [2018-11-14 17:28:57,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} assume true; {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} is VALID [2018-11-14 17:28:57,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {830#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-14 17:28:57,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {830#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset + 0, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset + 0, 4); {831#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (<= |main_#t~mem9| 9) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} is VALID [2018-11-14 17:28:57,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {831#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (<= |main_#t~mem9| 9) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset + 0, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset + 0, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem13; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-14 17:28:57,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-14 17:28:57,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} assume true; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-14 17:28:57,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {833#(<= |main_#t~mem7| 99)} is VALID [2018-11-14 17:28:57,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {833#(<= |main_#t~mem7| 99)} assume !(#t~mem7 < 100);havoc #t~mem7; {826#false} is VALID [2018-11-14 17:28:57,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {826#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {826#false} is VALID [2018-11-14 17:28:57,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {826#false} assume !(#t~mem15 == 100);havoc #t~mem15; {826#false} is VALID [2018-11-14 17:28:57,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {826#false} assume !false; {826#false} is VALID [2018-11-14 17:28:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:57,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:57,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:57,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:57,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:57,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-14 17:28:57,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-14 17:28:57,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:57,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,024 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 18 treesize of output 15 [2018-11-14 17:28:58,031 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 17:28:58,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:58,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-14 17:28:58,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,085 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 18 treesize of output 15 [2018-11-14 17:28:58,090 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 17:28:58,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:28:58,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-14 17:28:58,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,254 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,259 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:28:58,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:28:58,280 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:53 [2018-11-14 17:29:06,150 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:29:06,389 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-11-14 17:29:06,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-14 17:29:06,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-14 17:29:06,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 17:29:06,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-14 17:29:06,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-14 17:29:06,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,554 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 33 treesize of output 31 [2018-11-14 17:29:06,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,588 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:29:06,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 75 [2018-11-14 17:29:06,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-14 17:29:06,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-14 17:29:06,656 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,667 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 86 [2018-11-14 17:29:06,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:06,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-14 17:29:06,720 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,738 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,751 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:06,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:29:06,784 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:133, output treesize:122 [2018-11-14 17:29:06,799 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:29:07,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 157 [2018-11-14 17:29:07,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2018-11-14 17:29:07,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 83 [2018-11-14 17:29:07,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:29:07,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 17:29:07,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2018-11-14 17:29:07,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 73 [2018-11-14 17:29:07,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-14 17:29:07,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 33 [2018-11-14 17:29:07,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-14 17:29:07,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-11-14 17:29:07,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-14 17:29:07,709 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-14 17:29:07,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,742 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-14 17:29:07,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 24 [2018-11-14 17:29:07,771 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 13 [2018-11-14 17:29:07,791 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,799 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-11-14 17:29:07,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-14 17:29:07,824 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-11-14 17:29:07,863 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,872 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-14 17:29:07,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-14 17:29:07,892 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:07,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-14 17:29:07,918 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,926 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:07,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-14 17:29:07,968 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:198, output treesize:57 [2018-11-14 17:29:07,979 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:29:11,121 WARN L854 $PredicateComparison]: unable to prove that (or (<= (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (let ((.cse0 (* 2 v_arrayElimCell_71))) (and (= .cse0 (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset)) (<= .cse0 100)))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (let ((.cse1 (select |c_#memory_int| main_~list~0.base))) (let ((.cse2 (+ (select .cse1 main_~list~0.offset) (select .cse1 c_main_~m~0.offset)))) (and (= (store .cse1 c_main_~m~0.offset .cse2) (select |c_#memory_int| c_main_~m~0.base)) (<= .cse2 100)))))) is different from true [2018-11-14 17:29:21,986 WARN L179 SmtUtils]: Spent 8.55 s on a formula simplification. DAG size of input: 31 DAG size of output: 10 [2018-11-14 17:29:22,042 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 22 treesize of output 16 [2018-11-14 17:29:22,049 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 16 treesize of output 7 [2018-11-14 17:29:22,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:22,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:22,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:22,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-14 17:29:22,063 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:29:22,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2018-11-14 17:29:22,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {825#true} is VALID [2018-11-14 17:29:22,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2018-11-14 17:29:22,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #63#return; {825#true} is VALID [2018-11-14 17:29:22,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret16 := main(); {825#true} is VALID [2018-11-14 17:29:22,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset + 0, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~head~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset + 8, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-14 17:29:22,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume true; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-14 17:29:22,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-14 17:29:22,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-14 17:29:22,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset + 0, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~n~0.offset + 4, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~n~0.offset + 8, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~list~0.offset + 8, 4); {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-14 17:29:22,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume true; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-14 17:29:22,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-14 17:29:22,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-14 17:29:22,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-14 17:29:22,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} assume true; {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-14 17:29:22,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-14 17:29:22,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset + 0, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset + 0, 4); {888#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} is VALID [2018-11-14 17:29:22,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 4, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset + 0, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset + 0, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem13; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-14 17:29:22,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-14 17:29:22,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} assume true; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-14 17:29:22,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset + 0, 4); {902#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-14 17:29:22,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {902#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~mem7 < 100);havoc #t~mem7; {906#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} is VALID [2018-11-14 17:29:22,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {906#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} call #t~mem15 := read~int(~m~0.base, ~m~0.offset + 0, 4); {910#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} is VALID [2018-11-14 17:29:22,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {910#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} assume !(#t~mem15 == 100);havoc #t~mem15; {826#false} is VALID [2018-11-14 17:29:22,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {826#false} assume !false; {826#false} is VALID [2018-11-14 17:29:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-14 17:29:22,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:22,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-14 17:29:22,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-11-14 17:29:22,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:22,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:29:22,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:22,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:29:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:29:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=204, Unknown=2, NotChecked=28, Total=272 [2018-11-14 17:29:22,299 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 17 states. [2018-11-14 17:29:35,345 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-11-14 17:29:35,950 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2018-11-14 17:29:37,190 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2018-11-14 17:29:37,573 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2018-11-14 17:29:37,762 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-14 17:29:51,147 WARN L179 SmtUtils]: Spent 10.43 s on a formula simplification. DAG size of input: 86 DAG size of output: 69