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_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:46:09,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:46:09,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:46:09,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:46:09,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:46:09,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:46:09,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:46:09,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:46:09,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:46:09,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:46:09,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:46:09,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:46:09,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:46:09,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:46:09,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:46:09,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:46:09,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:46:09,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:46:09,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:46:09,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:46:09,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:46:09,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:46:09,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:46:09,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:46:09,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:46:09,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:46:09,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:46:09,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:46:09,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:46:09,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:46:09,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:46:09,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:46:09,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:46:09,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:46:09,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:46:09,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:46:09,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:46:09,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:46:09,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:46:09,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:46:09,690 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:46:09,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:46:09,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:46:09,691 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:46:09,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:46:09,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:46:09,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:46:09,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:46:09,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:46:09,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:46:09,694 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:46:09,695 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:46:09,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:46:09,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:46:09,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:46:09,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:46:09,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:46:09,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:46:09,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:46:09,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:46:09,696 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:46:09,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:46:09,698 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:46:09,698 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:46:09,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:46:09,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:46:09,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:46:09,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:46:09,771 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:46:09,771 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:46:09,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:46:09,832 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed87b78/cc8fd95730c14a1cb192daee3ec92432/FLAGc186fda1d [2018-11-18 21:46:10,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:46:10,369 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:46:10,383 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed87b78/cc8fd95730c14a1cb192daee3ec92432/FLAGc186fda1d [2018-11-18 21:46:10,629 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed87b78/cc8fd95730c14a1cb192daee3ec92432 [2018-11-18 21:46:10,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:46:10,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:46:10,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:46:10,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:46:10,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:46:10,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:10" (1/1) ... [2018-11-18 21:46:10,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3295985a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:10, skipping insertion in model container [2018-11-18 21:46:10,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:10" (1/1) ... [2018-11-18 21:46:10,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:46:10,713 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:46:11,201 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:46:11,214 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:46:11,307 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:46:11,478 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:46:11,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11 WrapperNode [2018-11-18 21:46:11,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:46:11,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:46:11,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:46:11,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:46:11,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (1/1) ... [2018-11-18 21:46:11,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:46:11,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:46:11,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:46:11,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:46:11,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (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-18 21:46:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:46:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:46:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 21:46:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 21:46:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-18 21:46:11,660 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sll [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure init_back_link [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure reverse_dll [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_fw_link [2018-11-18 21:46:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2018-11-18 21:46:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2018-11-18 21:46:11,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:46:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:46:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 21:46:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:46:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:46:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:46:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:46:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:46:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:46:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:46:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:46:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:46:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:46:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:46:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:46:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:46:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:46:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:46:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:46:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:46:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:46:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:46:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:46:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:46:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2018-11-18 21:46:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure create_sll [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:46:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure init_back_link [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure reverse_dll [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure remove_fw_link [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:46:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:46:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:46:13,830 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:46:13,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:13 BoogieIcfgContainer [2018-11-18 21:46:13,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:46:13,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:46:13,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:46:13,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:46:13,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:46:10" (1/3) ... [2018-11-18 21:46:13,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cf4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:13, skipping insertion in model container [2018-11-18 21:46:13,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:11" (2/3) ... [2018-11-18 21:46:13,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cf4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:13, skipping insertion in model container [2018-11-18 21:46:13,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:13" (3/3) ... [2018-11-18 21:46:13,839 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:46:13,849 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:46:13,857 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:46:13,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:46:13,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:46:13,908 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:46:13,908 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:46:13,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:46:13,909 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:46:13,909 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:46:13,909 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:46:13,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:46:13,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:46:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-11-18 21:46:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:46:13,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:46:13,942 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:46:13,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:46:13,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:46:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1686873154, now seen corresponding path program 1 times [2018-11-18 21:46:13,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:46:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:46:13,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:46:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:14,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:46:14,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-18 21:46:14,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {136#true} is VALID [2018-11-18 21:46:14,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-18 21:46:14,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #436#return; {136#true} is VALID [2018-11-18 21:46:14,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret37 := main(); {136#true} is VALID [2018-11-18 21:46:14,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {136#true} call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32); {136#true} is VALID [2018-11-18 21:46:14,160 INFO L256 TraceCheckUtils]: 6: Hoare triple {136#true} call #t~ret19.base, #t~ret19.offset := create_sll(~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {136#true} is VALID [2018-11-18 21:46:14,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {136#true} ~pp1.base, ~pp1.offset := #in~pp1.base, #in~pp1.offset;~pp2.base, ~pp2.offset := #in~pp2.base, #in~pp2.offset;call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {136#true} is VALID [2018-11-18 21:46:14,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#true} assume !true; {137#false} is VALID [2018-11-18 21:46:14,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {137#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(#t~mem6.base, #t~mem6.offset, ~pp2.base, ~pp2.offset, 4bv32);havoc #t~mem6.base, #t~mem6.offset; {137#false} is VALID [2018-11-18 21:46:14,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#false} assume !true; {137#false} is VALID [2018-11-18 21:46:14,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {137#false} call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(#t~mem8.base, #t~mem8.offset, ~pp1.base, ~pp1.offset, 4bv32);havoc #t~mem8.base, #t~mem8.offset; {137#false} is VALID [2018-11-18 21:46:14,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {137#false} assume !true; {137#false} is VALID [2018-11-18 21:46:14,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {137#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {137#false} is VALID [2018-11-18 21:46:14,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {137#false} assume true; {137#false} is VALID [2018-11-18 21:46:14,169 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {137#false} {136#true} #392#return; {137#false} is VALID [2018-11-18 21:46:14,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {137#false} ~list~1.base, ~list~1.offset := #t~ret19.base, #t~ret19.offset;havoc #t~ret19.base, #t~ret19.offset; {137#false} is VALID [2018-11-18 21:46:14,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {137#false} assume !true; {137#false} is VALID [2018-11-18 21:46:14,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {137#false} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#p2~0.base, ~#p2~0.offset, 4bv32); {137#false} is VALID [2018-11-18 21:46:14,170 INFO L256 TraceCheckUtils]: 19: Hoare triple {137#false} call check_seq_next(#t~mem20.base, #t~mem20.offset, #t~mem21.base, #t~mem21.offset); {137#false} is VALID [2018-11-18 21:46:14,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {137#false} ~beg.base, ~beg.offset := #in~beg.base, #in~beg.offset;~end.base, ~end.offset := #in~end.base, #in~end.offset; {137#false} is VALID [2018-11-18 21:46:14,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {137#false} assume true; {137#false} is VALID [2018-11-18 21:46:14,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {137#false} assume ~beg.base == 0bv32 && ~beg.offset == 0bv32; {137#false} is VALID [2018-11-18 21:46:14,172 INFO L256 TraceCheckUtils]: 23: Hoare triple {137#false} call fail(); {137#false} is VALID [2018-11-18 21:46:14,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-18 21:46:14,177 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-18 21:46:14,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:46:14,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:46:14,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:46:14,191 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 21:46:14,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:46:14,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:46:14,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:46:14,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:46:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:46:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:46:14,283 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 2 states. [2018-11-18 21:46:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:46:15,113 INFO L93 Difference]: Finished difference Result 256 states and 398 transitions. [2018-11-18 21:46:15,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:46:15,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 21:46:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:46:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:46:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 398 transitions. [2018-11-18 21:46:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:46:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 398 transitions. [2018-11-18 21:46:15,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 398 transitions. [2018-11-18 21:46:15,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:46:15,923 INFO L225 Difference]: With dead ends: 256 [2018-11-18 21:46:15,924 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 21:46:15,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-18 21:46:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 21:46:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-18 21:46:16,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:46:16,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2018-11-18 21:46:16,037 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2018-11-18 21:46:16,037 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2018-11-18 21:46:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:46:16,050 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2018-11-18 21:46:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-18 21:46:16,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:46:16,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:46:16,053 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2018-11-18 21:46:16,054 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2018-11-18 21:46:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:46:16,064 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2018-11-18 21:46:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-18 21:46:16,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:46:16,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:46:16,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:46:16,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:46:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 21:46:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-11-18 21:46:16,078 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 25 [2018-11-18 21:46:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:46:16,079 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-11-18 21:46:16,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:46:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-18 21:46:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 21:46:16,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:46:16,082 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:46:16,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:46:16,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:46:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1516720109, now seen corresponding path program 1 times [2018-11-18 21:46:16,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:46:16,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:46:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:46:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:16,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:46:16,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 21:46:16,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:16,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:16,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:46:16,579 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:18,927 WARN L854 $PredicateComparison]: unable to prove that (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| chain_node_~node~0.base (_ bv1 1))))) is different from true [2018-11-18 21:46:18,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:18,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:18,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 21:46:18,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:19,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:46:19,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-11-18 21:46:19,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:19,636 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-18 21:46:19,657 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 28 treesize of output 27 [2018-11-18 21:46:19,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:19,854 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 25 treesize of output 29 [2018-11-18 21:46:19,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,073 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 27 treesize of output 22 [2018-11-18 21:46:20,086 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 7 [2018-11-18 21:46:20,088 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,263 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 26 treesize of output 34 [2018-11-18 21:46:20,332 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-18 21:46:20,342 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 21:46:20,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 19 treesize of output 22 [2018-11-18 21:46:20,472 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,510 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:46:20,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,567 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-18 21:46:20,568 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:51, output treesize:28 [2018-11-18 21:46:20,588 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:20,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:20,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:20,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:20,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 56 [2018-11-18 21:46:20,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:20,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:46:20,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:60 [2018-11-18 21:46:20,860 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:21,144 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 49 treesize of output 53 [2018-11-18 21:46:21,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-18 21:46:21,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:21,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:21,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:46:21,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-11-18 21:46:24,096 WARN L854 $PredicateComparison]: unable to prove that (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (_ bv0 32))) (= (select |c_old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) (store .cse1 (_ bv0 32) (select (select (store |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base .cse1) |c_chain_node_#in~ppnode.base|) |c_chain_node_#in~ppnode.offset|)))))) (store .cse0 |c_chain_node_#in~ppnode.base| (store (select .cse0 |c_chain_node_#in~ppnode.base|) |c_chain_node_#in~ppnode.offset| chain_node_~node~0.base))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-18 21:46:24,637 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2018-11-18 21:46:24,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:24,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:24,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-11-18 21:46:24,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:24,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 92 [2018-11-18 21:46:24,955 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 81 treesize of output 83 [2018-11-18 21:46:24,967 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-18 21:46:24,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 21:46:24,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:25,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:25,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:25,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:25,568 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 88 [2018-11-18 21:46:25,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:25,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:25,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 104 [2018-11-18 21:46:25,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2018-11-18 21:46:25,794 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:25,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-11-18 21:46:25,986 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:26,099 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:46:26,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-11-18 21:46:26,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 21:46:26,324 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:26,364 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:26,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:27,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:27,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 90 [2018-11-18 21:46:27,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-11-18 21:46:27,343 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:27,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2018-11-18 21:46:27,566 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 21:46:27,791 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:28,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:28,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:28,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2018-11-18 21:46:28,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-11-18 21:46:28,398 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:28,448 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:28,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:28,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 68 [2018-11-18 21:46:28,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-18 21:46:28,490 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:28,528 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:28,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:29,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 21:46:29,061 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 5 variables, input treesize:140, output treesize:173 [2018-11-18 21:46:29,105 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:30,051 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-11-18 21:46:30,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 75 [2018-11-18 21:46:30,315 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 73 [2018-11-18 21:46:30,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 21:46:30,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2018-11-18 21:46:30,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:30,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-18 21:46:30,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:30,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:30,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:30,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2018-11-18 21:46:30,975 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-18 21:46:31,118 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-18 21:46:31,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:31,146 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 21:46:31,150 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:31,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:31,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:31,178 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:138, output treesize:4 [2018-11-18 21:46:31,187 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:31,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {989#true} call ULTIMATE.init(); {989#true} is VALID [2018-11-18 21:46:31,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {989#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {989#true} is VALID [2018-11-18 21:46:31,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {989#true} assume true; {989#true} is VALID [2018-11-18 21:46:31,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {989#true} {989#true} #436#return; {989#true} is VALID [2018-11-18 21:46:31,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {989#true} call #t~ret37 := main(); {989#true} is VALID [2018-11-18 21:46:31,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {989#true} call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32); {1009#(= (_ bv0 32) |main_~#p1~0.offset|)} is VALID [2018-11-18 21:46:31,336 INFO L256 TraceCheckUtils]: 6: Hoare triple {1009#(= (_ bv0 32) |main_~#p1~0.offset|)} call #t~ret19.base, #t~ret19.offset := create_sll(~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {989#true} is VALID [2018-11-18 21:46:31,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {989#true} ~pp1.base, ~pp1.offset := #in~pp1.base, #in~pp1.offset;~pp2.base, ~pp2.offset := #in~pp2.base, #in~pp2.offset;call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {1016#(and (= (_ bv1 1) (select |#valid| |create_sll_~#list~0.base|)) (= (_ bv0 32) |create_sll_~#list~0.offset|) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {1016#(and (= (_ bv1 1) (select |#valid| |create_sll_~#list~0.base|)) (= (_ bv0 32) |create_sll_~#list~0.offset|) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} assume true; {1016#(and (= (_ bv1 1) (select |#valid| |create_sll_~#list~0.base|)) (= (_ bv0 32) |create_sll_~#list~0.offset|) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,340 INFO L256 TraceCheckUtils]: 9: Hoare triple {1016#(and (= (_ bv1 1) (select |#valid| |create_sll_~#list~0.base|)) (= (_ bv0 32) |create_sll_~#list~0.offset|) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} call chain_node(~#list~0.base, ~#list~0.offset); {1023#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 21:46:31,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {1023#(= |#valid| |old(#valid)|)} ~ppnode.base, ~ppnode.offset := #in~ppnode.base, #in~ppnode.offset; {1023#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 21:46:31,342 INFO L256 TraceCheckUtils]: 11: Hoare triple {1023#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := alloc_node(); {1023#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 21:46:31,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1023#(= |#valid| |old(#valid)|)} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; {1033#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {1033#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); {1033#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {1033#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~ptr~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1040#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} is VALID [2018-11-18 21:46:31,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {1040#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} assume true; {1040#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} is VALID [2018-11-18 21:46:31,347 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1040#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} {1023#(= |#valid| |old(#valid)|)} #428#return; {1047#(and (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |chain_node_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-18 21:46:31,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(and (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |chain_node_#t~ret3.base| (_ bv1 1))))} ~node~0.base, ~node~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~ppnode.base, ~ppnode.offset, 4bv32);call write~$Pointer$(#t~mem4.base, #t~mem4.offset, ~node~0.base, ~node~0.offset, 4bv32);havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~node~0.base, ~node~0.offset, ~ppnode.base, ~ppnode.offset, 4bv32); {1051#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| chain_node_~node~0.base (_ bv1 1)))))} is VALID [2018-11-18 21:46:31,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {1051#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| chain_node_~node~0.base (_ bv1 1)))))} assume true; {1051#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| chain_node_~node~0.base (_ bv1 1)))))} is VALID [2018-11-18 21:46:31,361 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1051#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| chain_node_~node~0.base (_ bv1 1)))))} {1016#(and (= (_ bv1 1) (select |#valid| |create_sll_~#list~0.base|)) (= (_ bv0 32) |create_sll_~#list~0.offset|) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} #422#return; {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(#t~mem6.base, #t~mem6.offset, ~pp2.base, ~pp2.offset, 4bv32);havoc #t~mem6.base, #t~mem6.offset; {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} assume true; {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,364 INFO L256 TraceCheckUtils]: 23: Hoare triple {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} call chain_node(~#list~0.base, ~#list~0.offset); {1023#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 21:46:31,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {1023#(= |#valid| |old(#valid)|)} ~ppnode.base, ~ppnode.offset := #in~ppnode.base, #in~ppnode.offset; {1074#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} is VALID [2018-11-18 21:46:31,371 INFO L256 TraceCheckUtils]: 25: Hoare triple {1074#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} call #t~ret3.base, #t~ret3.offset := alloc_node(); {1023#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 21:46:31,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {1023#(= |#valid| |old(#valid)|)} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; {1081#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {1081#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); {1081#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {1081#(and (= |#valid| (store |old(#valid)| alloc_node_~ptr~0.base (_ bv1 1))) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~ptr~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1088#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (not (= (_ bv0 32) |alloc_node_#res.base|)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} is VALID [2018-11-18 21:46:31,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {1088#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (not (= (_ bv0 32) |alloc_node_#res.base|)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} assume true; {1088#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (not (= (_ bv0 32) |alloc_node_#res.base|)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} is VALID [2018-11-18 21:46:31,378 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1088#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (not (= (_ bv0 32) |alloc_node_#res.base|)) (= |#valid| (store |old(#valid)| |alloc_node_#res.base| (_ bv1 1))))} {1074#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} #428#return; {1095#(and (not (= |chain_node_#t~ret3.base| (_ bv0 32))) (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= |#valid| (store |old(#valid)| |chain_node_#t~ret3.base| (_ bv1 1))) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} is VALID [2018-11-18 21:46:31,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {1095#(and (not (= |chain_node_#t~ret3.base| (_ bv0 32))) (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= |#valid| (store |old(#valid)| |chain_node_#t~ret3.base| (_ bv1 1))) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} ~node~0.base, ~node~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~ppnode.base, ~ppnode.offset, 4bv32);call write~$Pointer$(#t~mem4.base, #t~mem4.offset, ~node~0.base, ~node~0.offset, 4bv32);havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~node~0.base, ~node~0.offset, ~ppnode.base, ~ppnode.offset, 4bv32); {1099#(and (not (= (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv0 32))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv1 1))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|)) (_ bv0 1)))} is VALID [2018-11-18 21:46:31,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {1099#(and (not (= (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv0 32))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv1 1))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|)) (_ bv0 1)))} assume true; {1099#(and (not (= (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv0 32))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv1 1))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|)) (_ bv0 1)))} is VALID [2018-11-18 21:46:31,385 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1099#(and (not (= (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv0 32))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|) (_ bv1 1))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|)) (_ bv0 1)))} {1058#(and (= (_ bv0 32) |create_sll_~#list~0.offset|) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (= (bvadd (select |#valid| chain_node_~node~0.base) (_ bv1 1)) (_ bv0 1)) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} #424#return; {1106#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {1106#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {1106#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} is VALID [2018-11-18 21:46:31,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {1106#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (= create_sll_~pp1.base |create_sll_#in~pp1.base|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))) (= create_sll_~pp1.offset |create_sll_#in~pp1.offset|))} call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);call write~$Pointer$(#t~mem8.base, #t~mem8.offset, ~pp1.base, ~pp1.offset, 4bv32);havoc #t~mem8.base, #t~mem8.offset; {1113#(and (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))))} is VALID [2018-11-18 21:46:31,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {1113#(and (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))))} assume true; {1113#(and (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))))} is VALID [2018-11-18 21:46:31,396 INFO L256 TraceCheckUtils]: 37: Hoare triple {1113#(and (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))))} call chain_node(~#list~0.base, ~#list~0.offset); {1120#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 21:46:31,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {1120#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~ppnode.base, ~ppnode.offset := #in~ppnode.base, #in~ppnode.offset; {1124#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} is VALID [2018-11-18 21:46:31,400 INFO L256 TraceCheckUtils]: 39: Hoare triple {1124#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} call #t~ret3.base, #t~ret3.offset := alloc_node(); {1120#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 21:46:31,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {1120#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; {1131#(and (= (_ bv0 32) alloc_node_~ptr~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,403 INFO L273 TraceCheckUtils]: 41: Hoare triple {1131#(and (= (_ bv0 32) alloc_node_~ptr~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); {1131#(and (= (_ bv0 32) alloc_node_~ptr~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} is VALID [2018-11-18 21:46:31,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {1131#(and (= (_ bv0 32) alloc_node_~ptr~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= (_ bv0 32) alloc_node_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| alloc_node_~ptr~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~ptr~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1138#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |alloc_node_#res.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |alloc_node_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_node_#res.base|) |alloc_node_#res.offset| (_ bv0 32)) (bvadd |alloc_node_#res.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= (_ bv0 32) |alloc_node_#res.base|)))} is VALID [2018-11-18 21:46:31,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {1138#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |alloc_node_#res.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |alloc_node_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_node_#res.base|) |alloc_node_#res.offset| (_ bv0 32)) (bvadd |alloc_node_#res.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= (_ bv0 32) |alloc_node_#res.base|)))} assume true; {1138#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |alloc_node_#res.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |alloc_node_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_node_#res.base|) |alloc_node_#res.offset| (_ bv0 32)) (bvadd |alloc_node_#res.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= (_ bv0 32) |alloc_node_#res.base|)))} is VALID [2018-11-18 21:46:31,408 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1138#(and (= (select |old(#valid)| |alloc_node_#res.base|) (_ bv0 1)) (= |alloc_node_#res.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |alloc_node_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_node_#res.base|) |alloc_node_#res.offset| (_ bv0 32)) (bvadd |alloc_node_#res.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= (_ bv0 32) |alloc_node_#res.base|)))} {1124#(and (= |#valid| |old(#valid)|) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} #428#return; {1145#(and (= (store |old(#memory_$Pointer$.base)| |chain_node_#t~ret3.base| (store (store (select |old(#memory_$Pointer$.base)| |chain_node_#t~ret3.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= |chain_node_#t~ret3.base| (_ bv0 32))) (= (_ bv0 32) |chain_node_#t~ret3.offset|) (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} is VALID [2018-11-18 21:46:31,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {1145#(and (= (store |old(#memory_$Pointer$.base)| |chain_node_#t~ret3.base| (store (store (select |old(#memory_$Pointer$.base)| |chain_node_#t~ret3.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.base|) (not (= |chain_node_#t~ret3.base| (_ bv0 32))) (= (_ bv0 32) |chain_node_#t~ret3.offset|) (= (select |old(#valid)| |chain_node_#t~ret3.base|) (_ bv0 1)) (= chain_node_~ppnode.offset |chain_node_#in~ppnode.offset|) (= chain_node_~ppnode.base |chain_node_#in~ppnode.base|))} ~node~0.base, ~node~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~ppnode.base, ~ppnode.offset, 4bv32);call write~$Pointer$(#t~mem4.base, #t~mem4.offset, ~node~0.base, ~node~0.offset, 4bv32);havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~node~0.base, ~node~0.offset, ~ppnode.base, ~ppnode.offset, 4bv32); {1149#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (_ bv0 32))) (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= (store (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base| (store (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset| chain_node_~node~0.base)) |#memory_$Pointer$.base|)))} is VALID [2018-11-18 21:46:31,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {1149#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (_ bv0 32))) (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= (store (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base| (store (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset| chain_node_~node~0.base)) |#memory_$Pointer$.base|)))} assume true; {1149#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (_ bv0 32))) (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= (store (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base| (store (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset| chain_node_~node~0.base)) |#memory_$Pointer$.base|)))} is VALID [2018-11-18 21:46:31,773 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1149#(exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (_ bv0 32))) (= (select |old(#valid)| chain_node_~node~0.base) (_ bv0 1)) (= (store (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base| (store (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| chain_node_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset|))) |chain_node_#in~ppnode.base|) |chain_node_#in~ppnode.offset| chain_node_~node~0.base)) |#memory_$Pointer$.base|)))} {1113#(and (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (= (_ bv0 32) |create_sll_~#list~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|) |create_sll_~#list~0.base|)) (not (= (_ bv0 1) (select |#valid| |create_sll_~#list~0.base|))) (exists ((chain_node_~node~0.base (_ BitVec 32))) (and (not (= chain_node_~node~0.base (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) |create_sll_~#list~0.offset|))) (not (= chain_node_~node~0.base |create_sll_~#list~0.base|)) (= (select |#valid| chain_node_~node~0.base) (select |#valid| |create_sll_~#list~0.base|)))))} #426#return; {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} is VALID [2018-11-18 21:46:31,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} assume !(0bv32 != #t~nondet9);havoc #t~nondet9; {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} is VALID [2018-11-18 21:46:31,778 INFO L273 TraceCheckUtils]: 49: Hoare triple {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} is VALID [2018-11-18 21:46:31,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} assume true; {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} is VALID [2018-11-18 21:46:31,787 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1156#(or (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) |create_sll_#in~pp1.base|)) (not (= (_ bv0 32) |create_sll_#in~pp1.base|)) (= (_ bv4 32) |create_sll_#in~pp1.offset|) (exists ((v_prenex_12 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) v_prenex_12)) (= (select (select |#memory_$Pointer$.base| v_prenex_12) (_ bv0 32)) |create_sll_#in~pp1.base|))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |create_sll_#in~pp1.offset|) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) (_ bv0 32))) (_ bv0 32)) |create_sll_#in~pp1.base|))) (and (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (_ bv0 32))) (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_#in~pp1.base|) |create_sll_#in~pp1.offset|) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))))))))} {1009#(= (_ bv0 32) |main_~#p1~0.offset|)} #392#return; {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} is VALID [2018-11-18 21:46:31,788 INFO L273 TraceCheckUtils]: 52: Hoare triple {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} ~list~1.base, ~list~1.offset := #t~ret19.base, #t~ret19.offset;havoc #t~ret19.base, #t~ret19.offset; {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} is VALID [2018-11-18 21:46:31,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} assume true; {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} is VALID [2018-11-18 21:46:31,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} assume true; {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} is VALID [2018-11-18 21:46:31,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {1169#(or (and (exists ((|create_sll_~#list~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |create_sll_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |create_sll_~#list~0.base|) (_ bv0 32)))))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|)))} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#p2~0.base, ~#p2~0.offset, 4bv32); {1182#(not (= |main_#t~mem20.base| (_ bv0 32)))} is VALID [2018-11-18 21:46:31,795 INFO L256 TraceCheckUtils]: 56: Hoare triple {1182#(not (= |main_#t~mem20.base| (_ bv0 32)))} call check_seq_next(#t~mem20.base, #t~mem20.offset, #t~mem21.base, #t~mem21.offset); {1186#(not (= (_ bv0 32) |check_seq_next_#in~beg.base|))} is VALID [2018-11-18 21:46:31,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {1186#(not (= (_ bv0 32) |check_seq_next_#in~beg.base|))} ~beg.base, ~beg.offset := #in~beg.base, #in~beg.offset;~end.base, ~end.offset := #in~end.base, #in~end.offset; {1190#(not (= check_seq_next_~beg.base (_ bv0 32)))} is VALID [2018-11-18 21:46:31,797 INFO L273 TraceCheckUtils]: 58: Hoare triple {1190#(not (= check_seq_next_~beg.base (_ bv0 32)))} assume true; {1190#(not (= check_seq_next_~beg.base (_ bv0 32)))} is VALID [2018-11-18 21:46:31,798 INFO L273 TraceCheckUtils]: 59: Hoare triple {1190#(not (= check_seq_next_~beg.base (_ bv0 32)))} assume ~beg.base == 0bv32 && ~beg.offset == 0bv32; {990#false} is VALID [2018-11-18 21:46:31,798 INFO L256 TraceCheckUtils]: 60: Hoare triple {990#false} call fail(); {990#false} is VALID [2018-11-18 21:46:31,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {990#false} assume !false; {990#false} is VALID [2018-11-18 21:46:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2018-11-18 21:46:31,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:46:32,662 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 21:46:33,147 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 21:46:33,408 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-18 21:46:33,564 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 21:46:34,729 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 21:46:35,263 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 21:46:36,023 WARN L180 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-18 21:46:36,821 WARN L180 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-18 21:46:38,161 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-18 21:46:38,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,179 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 37 treesize of output 42 [2018-11-18 21:46:38,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-11-18 21:46:38,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,341 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,341 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:38,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-18 21:46:38,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:38,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:38,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:38,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 283 [2018-11-18 21:46:38,717 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 13 treesize of output 12 [2018-11-18 21:46:38,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:38,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 161 [2018-11-18 21:46:38,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-11-18 21:46:38,932 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:38,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 95 [2018-11-18 21:46:39,265 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-11-18 21:46:39,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 21:46:39,275 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:39,339 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 76 [2018-11-18 21:46:39,481 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-18 21:46:39,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,546 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 63 [2018-11-18 21:46:39,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:39,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 21:46:39,578 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,579 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 26 treesize of output 35 [2018-11-18 21:46:39,585 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,603 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,634 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-18 21:46:39,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 21:46:39,805 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 15 treesize of output 9 [2018-11-18 21:46:39,825 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,844 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 6 treesize of output 1 [2018-11-18 21:46:39,846 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,851 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,867 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,877 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,887 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:39,943 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:693, output treesize:4 [2018-11-18 21:46:39,983 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:40,744 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 21:46:40,929 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 21:46:41,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 21:46:41,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP 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-18 21:46:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:46:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:46:41,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:46:41,495 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-18 21:46:41,503 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-18 21:46:41,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:41,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:41,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:41,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-11-18 21:46:41,534 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:42,412 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-18 21:46:42,425 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 28 treesize of output 27 [2018-11-18 21:46:42,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:42,644 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 25 treesize of output 29 [2018-11-18 21:46:42,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:42,925 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 27 treesize of output 22 [2018-11-18 21:46:42,935 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 7 [2018-11-18 21:46:42,970 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:42,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,154 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 23 treesize of output 33 [2018-11-18 21:46:43,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 23 [2018-11-18 21:46:43,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,276 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-18 21:46:43,283 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 21:46:43,312 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:46:43,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,353 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-18 21:46:43,354 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:8 [2018-11-18 21:46:43,374 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:46:43,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 34 [2018-11-18 21:46:43,673 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-18 21:46:43,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 20 [2018-11-18 21:46:43,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:43,771 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 21:46:46,637 WARN L854 $PredicateComparison]: unable to prove that (exists ((chain_node_~node~0.base (_ BitVec 32))) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) (store .cse1 (_ bv0 32) (select (select (store |c_old(#memory_$Pointer$.base)| chain_node_~node~0.base .cse1) |c_chain_node_#in~ppnode.base|) |c_chain_node_#in~ppnode.offset|)))))) (store .cse0 |c_chain_node_#in~ppnode.base| (store (select .cse0 |c_chain_node_#in~ppnode.base|) |c_chain_node_#in~ppnode.offset| chain_node_~node~0.base))) |c_#memory_$Pointer$.base|)) is different from true [2018-11-18 21:46:47,653 WARN L180 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-18 21:46:47,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 68 [2018-11-18 21:46:47,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:47,868 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 60 [2018-11-18 21:46:47,877 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-18 21:46:47,890 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 19 [2018-11-18 21:46:47,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:47,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:48,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:48,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:48,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 76 [2018-11-18 21:46:48,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 72 treesize of output 64 [2018-11-18 21:46:48,109 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:48,259 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 52 treesize of output 48 [2018-11-18 21:46:48,261 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:48,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:46:48,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:49,153 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 57 treesize of output 59 [2018-11-18 21:46:49,159 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-18 21:46:49,168 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 19 [2018-11-18 21:46:49,169 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:49,183 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:49,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:49,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2018-11-18 21:46:49,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-18 21:46:49,827 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:50,024 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 2 case distinctions, treesize of input 45 treesize of output 45 [2018-11-18 21:46:50,027 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 21:46:50,152 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:50,642 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 56 treesize of output 47 [2018-11-18 21:46:50,656 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 33 treesize of output 27 [2018-11-18 21:46:50,659 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:50,686 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:50,708 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 48 treesize of output 41 [2018-11-18 21:46:50,722 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 24 treesize of output 16 [2018-11-18 21:46:50,724 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:50,750 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:46:51,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:51,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 98 [2018-11-18 21:46:51,270 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2018-11-18 21:46:52,889 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-11-18 21:46:52,901 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 71 treesize of output 76 [2018-11-18 21:46:52,905 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:53,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:53,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:53,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-11-18 21:46:53,430 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:53,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:46:53,444 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 78 treesize of output 80 [2018-11-18 21:46:53,446 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 21:46:53,814 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:46:56,659 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 80 [2018-11-18 21:47:07,286 WARN L180 SmtUtils]: Spent 10.58 s on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-18 21:47:07,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2018-11-18 21:47:07,361 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-18 21:47:07,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 91 [2018-11-18 21:47:07,447 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-18 21:47:14,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-11-18 21:47:14,076 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:14,084 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-18 21:47:14,095 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:17,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 61 treesize of output 79 [2018-11-18 21:47:17,242 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-18 21:47:18,789 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 58 treesize of output 63 [2018-11-18 21:47:18,792 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:19,578 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 21:47:24,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:24,943 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 93 treesize of output 94 [2018-11-18 21:47:24,945 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:27,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:27,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-11-18 21:47:27,972 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,050 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 64 treesize of output 61 [2018-11-18 21:47:31,055 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,065 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 59 treesize of output 56 [2018-11-18 21:47:31,082 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,091 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 59 treesize of output 56 [2018-11-18 21:47:31,094 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,107 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 55 treesize of output 52 [2018-11-18 21:47:31,114 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,130 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 72 treesize of output 69 [2018-11-18 21:47:31,133 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,145 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 64 treesize of output 61 [2018-11-18 21:47:31,152 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,165 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 55 treesize of output 52 [2018-11-18 21:47:31,168 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,188 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 64 treesize of output 61 [2018-11-18 21:47:31,195 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:31,211 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 60 treesize of output 57 [2018-11-18 21:47:31,214 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-18 21:47:33,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:33,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 21:47:33,046 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 21 treesize of output 19 [2018-11-18 21:47:33,053 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,064 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,094 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-18 21:47:33,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-18 21:47:33,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-11-18 21:47:33,165 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,188 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,229 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-18 21:47:33,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 21:47:33,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 35 [2018-11-18 21:47:33,300 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,322 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,351 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-18 21:47:33,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-11-18 21:47:33,392 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 19 treesize of output 19 [2018-11-18 21:47:33,394 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,406 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,430 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-18 21:47:33,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-11-18 21:47:33,463 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 19 treesize of output 19 [2018-11-18 21:47:33,466 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,479 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,535 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-18 21:47:33,547 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:33,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 21:47:33,561 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 21 treesize of output 19 [2018-11-18 21:47:33,563 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,573 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,592 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-18 21:47:33,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:33,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-18 21:47:33,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 35 [2018-11-18 21:47:33,653 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,669 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,696 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:33,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-11-18 21:47:33,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-11-18 21:47:33,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 56 [2018-11-18 21:47:33,823 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-18 21:47:33,910 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:47:33,989 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:47:33,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-18 21:47:34,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-18 21:47:34,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-11-18 21:47:34,040 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:34,060 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:34,088 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:35,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:35,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-11-18 21:47:35,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 treesize of output 57 [2018-11-18 21:47:35,570 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 21:47:35,623 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:47:35,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 50 [2018-11-18 21:47:35,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:47:35,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 33 treesize of output 33 [2018-11-18 21:47:35,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-18 21:47:35,898 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 21:47:35,899 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_38 term size 11 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 21:47:35,906 INFO L168 Benchmark]: Toolchain (without parser) took 85266.68 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 833.0 MB. Max. memory is 7.1 GB. [2018-11-18 21:47:35,906 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:47:35,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2018-11-18 21:47:35,907 INFO L168 Benchmark]: Boogie Preprocessor took 127.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-18 21:47:35,907 INFO L168 Benchmark]: RCFGBuilder took 2224.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:47:35,908 INFO L168 Benchmark]: TraceAbstraction took 82072.39 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 328.7 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -331.7 MB). Peak memory consumption was 778.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:47:35,910 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2224.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82072.39 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 328.7 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -331.7 MB). Peak memory consumption was 778.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_38 term size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_38 term size 11: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...