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/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:05:24,455 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:05:24,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:05:24,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:05:24,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:05:24,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:05:24,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:05:24,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:05:24,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:05:24,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:05:24,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:05:24,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:05:24,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:05:24,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:05:24,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:05:24,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:05:24,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:05:24,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:05:24,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:05:24,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:05:24,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:05:24,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:05:24,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:05:24,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:05:24,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:05:24,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:05:24,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:05:24,510 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:05:24,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:05:24,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:05:24,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:05:24,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:05:24,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:05:24,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:05:24,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:05:24,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:05:24,515 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 22:05:24,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:05:24,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:05:24,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:05:24,542 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:05:24,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:05:24,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:05:24,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:05:24,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:05:24,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:05:24,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:05:24,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:05:24,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:05:24,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:05:24,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:05:24,545 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:05:24,545 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:05:24,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:05:24,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:05:24,546 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:05:24,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:05:24,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:05:24,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:05:24,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:05:24,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:05:24,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:05:24,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:05:24,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:05:24,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:05:24,549 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:05:24,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:05:24,549 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:05:24,549 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:05:24,549 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:05:24,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:05:24,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:05:24,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:05:24,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:05:24,629 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:05:24,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:24,691 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4194d5f/5e5a95a0e4764cdb9b9a7d98d1a0ec85/FLAG0314b0391 [2018-11-18 22:05:25,212 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:05:25,213 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:25,226 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4194d5f/5e5a95a0e4764cdb9b9a7d98d1a0ec85/FLAG0314b0391 [2018-11-18 22:05:25,500 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4194d5f/5e5a95a0e4764cdb9b9a7d98d1a0ec85 [2018-11-18 22:05:25,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:05:25,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:05:25,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:05:25,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:05:25,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:05:25,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:05:25" (1/1) ... [2018-11-18 22:05:25,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b58c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:25, skipping insertion in model container [2018-11-18 22:05:25,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:05:25" (1/1) ... [2018-11-18 22:05:25,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:05:25,600 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:05:26,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:05:26,070 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:05:26,146 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:05:26,303 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:05:26,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26 WrapperNode [2018-11-18 22:05:26,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:05:26,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:05:26,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:05:26,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:05:26,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (1/1) ... [2018-11-18 22:05:26,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:05:26,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:05:26,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:05:26,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:05:26,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (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 22:05:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:05:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:05:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:05:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:05:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:05:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:05:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-18 22:05:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-18 22:05:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-18 22:05:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-18 22:05:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:05:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:05:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:05:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:05:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:05:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:05:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:05:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:05:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:05:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:05:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:05:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:05:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:05:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:05:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:05:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:05:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:05:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:05:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:05:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:05:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:05:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:05:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:05:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:05:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:05:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:05:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:05:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:05:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:05:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:05:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:05:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:05:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:05:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:05:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:05:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:05:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:05:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:05:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:05:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:05:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:05:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:05:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:05:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:05:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:05:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:05:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:05:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-18 22:05:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-18 22:05:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:05:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:05:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-18 22:05:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:05:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-18 22:05:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:05:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:05:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:05:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:05:27,797 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:05:27,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:05:27 BoogieIcfgContainer [2018-11-18 22:05:27,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:05:27,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:05:27,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:05:27,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:05:27,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:05:25" (1/3) ... [2018-11-18 22:05:27,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaf6544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:05:27, skipping insertion in model container [2018-11-18 22:05:27,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:26" (2/3) ... [2018-11-18 22:05:27,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaf6544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:05:27, skipping insertion in model container [2018-11-18 22:05:27,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:05:27" (3/3) ... [2018-11-18 22:05:27,806 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:27,814 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:05:27,822 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:05:27,840 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:05:27,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:05:27,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:05:27,880 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:05:27,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:05:27,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:05:27,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:05:27,881 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:05:27,881 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:05:27,881 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:05:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-11-18 22:05:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:05:27,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:27,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:27,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:27,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash -587727745, now seen corresponding path program 1 times [2018-11-18 22:05:27,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:27,926 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 22:05:27,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:28,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:28,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {66#true} call ULTIMATE.init(); {66#true} is VALID [2018-11-18 22:05:28,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {66#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {66#true} is VALID [2018-11-18 22:05:28,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {66#true} assume true; {66#true} is VALID [2018-11-18 22:05:28,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {66#true} {66#true} #156#return; {66#true} is VALID [2018-11-18 22:05:28,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {66#true} call #t~ret17 := main(); {66#true} is VALID [2018-11-18 22:05:28,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {66#true} ~len~0 := 2bv32;~data~0 := 1bv32; {66#true} is VALID [2018-11-18 22:05:28,716 INFO L256 TraceCheckUtils]: 6: Hoare triple {66#true} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {66#true} is VALID [2018-11-18 22:05:28,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {66#true} ~len := #in~len;~data := #in~data; {66#true} is VALID [2018-11-18 22:05:28,719 INFO L256 TraceCheckUtils]: 8: Hoare triple {66#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {66#true} is VALID [2018-11-18 22:05:28,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {66#true} is VALID [2018-11-18 22:05:28,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {66#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {66#true} is VALID [2018-11-18 22:05:28,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {66#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {66#true} is VALID [2018-11-18 22:05:28,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {66#true} assume true; {66#true} is VALID [2018-11-18 22:05:28,721 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {66#true} {66#true} #152#return; {66#true} is VALID [2018-11-18 22:05:28,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {66#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {66#true} is VALID [2018-11-18 22:05:28,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {66#true} assume !true; {67#false} is VALID [2018-11-18 22:05:28,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {67#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {67#false} is VALID [2018-11-18 22:05:28,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {67#false} assume true; {67#false} is VALID [2018-11-18 22:05:28,723 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {67#false} {66#true} #144#return; {67#false} is VALID [2018-11-18 22:05:28,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {67#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {67#false} is VALID [2018-11-18 22:05:28,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {67#false} assume !true; {67#false} is VALID [2018-11-18 22:05:28,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {67#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {67#false} is VALID [2018-11-18 22:05:28,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {67#false} assume true; {67#false} is VALID [2018-11-18 22:05:28,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {67#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {67#false} is VALID [2018-11-18 22:05:28,724 INFO L256 TraceCheckUtils]: 24: Hoare triple {67#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {67#false} is VALID [2018-11-18 22:05:28,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {67#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {67#false} is VALID [2018-11-18 22:05:28,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {67#false} assume !true; {67#false} is VALID [2018-11-18 22:05:28,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {67#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {67#false} is VALID [2018-11-18 22:05:28,726 INFO L273 TraceCheckUtils]: 28: Hoare triple {67#false} assume true; {67#false} is VALID [2018-11-18 22:05:28,726 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {67#false} {67#false} #148#return; {67#false} is VALID [2018-11-18 22:05:28,726 INFO L273 TraceCheckUtils]: 30: Hoare triple {67#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {67#false} is VALID [2018-11-18 22:05:28,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {67#false} assume !false; {67#false} is VALID [2018-11-18 22:05:28,734 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 22:05:28,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:28,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:28,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:05:28,750 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-18 22:05:28,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:28,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:05:29,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:29,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:05:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:05:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:05:29,022 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-11-18 22:05:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:29,268 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2018-11-18 22:05:29,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:05:29,269 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-18 22:05:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:05:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2018-11-18 22:05:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:05:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2018-11-18 22:05:29,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 132 transitions. [2018-11-18 22:05:29,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:29,755 INFO L225 Difference]: With dead ends: 104 [2018-11-18 22:05:29,756 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:05:29,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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 22:05:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:05:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-18 22:05:29,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:29,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-18 22:05:29,820 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:05:29,820 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:05:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:29,827 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 22:05:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:05:29,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:29,828 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:05:29,829 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:05:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:29,834 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 22:05:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:05:29,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:29,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:29,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:29,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:05:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-18 22:05:29,842 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 32 [2018-11-18 22:05:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:29,842 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-18 22:05:29,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:05:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:05:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:05:29,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:29,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:29,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:29,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 86072246, now seen corresponding path program 1 times [2018-11-18 22:05:29,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:29,846 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 22:05:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:29,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:30,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-18 22:05:30,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {463#true} is VALID [2018-11-18 22:05:30,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-18 22:05:30,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #156#return; {463#true} is VALID [2018-11-18 22:05:30,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret17 := main(); {463#true} is VALID [2018-11-18 22:05:30,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {463#true} ~len~0 := 2bv32;~data~0 := 1bv32; {483#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:30,394 INFO L256 TraceCheckUtils]: 6: Hoare triple {483#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {463#true} is VALID [2018-11-18 22:05:30,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {463#true} ~len := #in~len;~data := #in~data; {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:05:30,404 INFO L256 TraceCheckUtils]: 8: Hoare triple {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {463#true} is VALID [2018-11-18 22:05:30,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {463#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {463#true} is VALID [2018-11-18 22:05:30,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {463#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {463#true} is VALID [2018-11-18 22:05:30,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {463#true} is VALID [2018-11-18 22:05:30,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-18 22:05:30,406 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {463#true} {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #152#return; {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:05:30,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:05:30,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:05:30,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {490#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:05:30,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:05:30,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:05:30,417 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {518#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {483#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {464#false} is VALID [2018-11-18 22:05:30,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {464#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {464#false} is VALID [2018-11-18 22:05:30,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {464#false} assume true; {464#false} is VALID [2018-11-18 22:05:30,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {464#false} assume !~bvsgt32(~i~0, 4294967295bv32); {464#false} is VALID [2018-11-18 22:05:30,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {464#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {464#false} is VALID [2018-11-18 22:05:30,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {464#false} assume true; {464#false} is VALID [2018-11-18 22:05:30,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {464#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {464#false} is VALID [2018-11-18 22:05:30,419 INFO L256 TraceCheckUtils]: 26: Hoare triple {464#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {464#false} is VALID [2018-11-18 22:05:30,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {464#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {464#false} is VALID [2018-11-18 22:05:30,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {464#false} assume true; {464#false} is VALID [2018-11-18 22:05:30,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {464#false} assume !~bvsgt32(~index, 0bv32); {464#false} is VALID [2018-11-18 22:05:30,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {464#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {464#false} is VALID [2018-11-18 22:05:30,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {464#false} assume true; {464#false} is VALID [2018-11-18 22:05:30,420 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {464#false} {464#false} #148#return; {464#false} is VALID [2018-11-18 22:05:30,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {464#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {464#false} is VALID [2018-11-18 22:05:30,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-18 22:05:30,423 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 22:05:30,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:30,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:30,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:05:30,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:05:30,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:30,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:05:30,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:30,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:05:30,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:05:30,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:05:30,629 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 5 states. [2018-11-18 22:05:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:31,264 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-18 22:05:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:05:31,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:05:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:05:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-18 22:05:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:05:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-18 22:05:31,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2018-11-18 22:05:31,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:31,448 INFO L225 Difference]: With dead ends: 79 [2018-11-18 22:05:31,449 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:05:31,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:05:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:05:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-18 22:05:31,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:31,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-18 22:05:31,497 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-18 22:05:31,497 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-18 22:05:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:31,502 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-18 22:05:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-18 22:05:31,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:31,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:31,503 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-18 22:05:31,503 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-18 22:05:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:31,507 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-18 22:05:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-18 22:05:31,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:31,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:31,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:31,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:05:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-18 22:05:31,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 35 [2018-11-18 22:05:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:31,513 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-18 22:05:31,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:05:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 22:05:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 22:05:31,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:31,515 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:31,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:31,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1178229704, now seen corresponding path program 1 times [2018-11-18 22:05:31,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:05:31,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:31,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:31,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {854#true} call ULTIMATE.init(); {854#true} is VALID [2018-11-18 22:05:31,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {854#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {854#true} is VALID [2018-11-18 22:05:31,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {854#true} {854#true} #156#return; {854#true} is VALID [2018-11-18 22:05:31,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {854#true} call #t~ret17 := main(); {854#true} is VALID [2018-11-18 22:05:31,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {854#true} ~len~0 := 2bv32;~data~0 := 1bv32; {874#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:31,765 INFO L256 TraceCheckUtils]: 6: Hoare triple {874#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {854#true} is VALID [2018-11-18 22:05:31,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {854#true} ~len := #in~len;~data := #in~data; {854#true} is VALID [2018-11-18 22:05:31,765 INFO L256 TraceCheckUtils]: 8: Hoare triple {854#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {854#true} is VALID [2018-11-18 22:05:31,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {854#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {854#true} is VALID [2018-11-18 22:05:31,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {854#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {854#true} is VALID [2018-11-18 22:05:31,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {854#true} is VALID [2018-11-18 22:05:31,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,767 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {854#true} {854#true} #152#return; {854#true} is VALID [2018-11-18 22:05:31,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {854#true} is VALID [2018-11-18 22:05:31,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {854#true} assume !!~bvsgt32(~len, 1bv32); {854#true} is VALID [2018-11-18 22:05:31,768 INFO L256 TraceCheckUtils]: 17: Hoare triple {854#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {854#true} is VALID [2018-11-18 22:05:31,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {854#true} is VALID [2018-11-18 22:05:31,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {854#true} is VALID [2018-11-18 22:05:31,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {854#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {854#true} is VALID [2018-11-18 22:05:31,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,769 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {854#true} {854#true} #154#return; {854#true} is VALID [2018-11-18 22:05:31,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {854#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {854#true} is VALID [2018-11-18 22:05:31,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {854#true} assume !~bvsgt32(~len, 1bv32); {854#true} is VALID [2018-11-18 22:05:31,770 INFO L273 TraceCheckUtils]: 26: Hoare triple {854#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {854#true} is VALID [2018-11-18 22:05:31,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {854#true} assume true; {854#true} is VALID [2018-11-18 22:05:31,778 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {854#true} {874#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {874#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:31,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {874#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {947#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:31,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {947#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {947#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:31,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {947#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {855#false} is VALID [2018-11-18 22:05:31,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {855#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {855#false} is VALID [2018-11-18 22:05:31,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {855#false} assume true; {855#false} is VALID [2018-11-18 22:05:31,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {855#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {855#false} is VALID [2018-11-18 22:05:31,785 INFO L256 TraceCheckUtils]: 35: Hoare triple {855#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {855#false} is VALID [2018-11-18 22:05:31,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {855#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {855#false} is VALID [2018-11-18 22:05:31,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {855#false} assume true; {855#false} is VALID [2018-11-18 22:05:31,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {855#false} assume !~bvsgt32(~index, 0bv32); {855#false} is VALID [2018-11-18 22:05:31,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {855#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {855#false} is VALID [2018-11-18 22:05:31,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {855#false} assume true; {855#false} is VALID [2018-11-18 22:05:31,787 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {855#false} {855#false} #148#return; {855#false} is VALID [2018-11-18 22:05:31,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {855#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {855#false} is VALID [2018-11-18 22:05:31,788 INFO L273 TraceCheckUtils]: 43: Hoare triple {855#false} assume !false; {855#false} is VALID [2018-11-18 22:05:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 22:05:31,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:05:31,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 22:05:31,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:31,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:05:31,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:31,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:05:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:05:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:05:31,866 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-11-18 22:05:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:32,261 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-18 22:05:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:05:32,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-18 22:05:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:05:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 22:05:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:05:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 22:05:32,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-18 22:05:32,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:32,502 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:05:32,503 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 22:05:32,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:05:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 22:05:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-18 22:05:32,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:32,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2018-11-18 22:05:32,576 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2018-11-18 22:05:32,576 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2018-11-18 22:05:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:32,582 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-18 22:05:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-18 22:05:32,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:32,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:32,583 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2018-11-18 22:05:32,583 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2018-11-18 22:05:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:32,588 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-18 22:05:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-18 22:05:32,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:32,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:32,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:32,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:05:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-18 22:05:32,593 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 44 [2018-11-18 22:05:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:32,593 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-18 22:05:32,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:05:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-18 22:05:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:05:32,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:32,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:32,596 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:32,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:32,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1917201261, now seen corresponding path program 1 times [2018-11-18 22:05:32,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:32,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:05:32,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:32,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:32,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1287#true} is VALID [2018-11-18 22:05:32,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1287#true} is VALID [2018-11-18 22:05:32,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #156#return; {1287#true} is VALID [2018-11-18 22:05:32,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret17 := main(); {1287#true} is VALID [2018-11-18 22:05:32,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {1287#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1307#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:32,971 INFO L256 TraceCheckUtils]: 6: Hoare triple {1307#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1287#true} is VALID [2018-11-18 22:05:32,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#true} ~len := #in~len;~data := #in~data; {1287#true} is VALID [2018-11-18 22:05:32,972 INFO L256 TraceCheckUtils]: 8: Hoare triple {1287#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1287#true} is VALID [2018-11-18 22:05:32,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {1287#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1287#true} is VALID [2018-11-18 22:05:32,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1287#true} is VALID [2018-11-18 22:05:32,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {1287#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1287#true} is VALID [2018-11-18 22:05:32,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,973 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1287#true} {1287#true} #152#return; {1287#true} is VALID [2018-11-18 22:05:32,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {1287#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1287#true} is VALID [2018-11-18 22:05:32,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {1287#true} assume !!~bvsgt32(~len, 1bv32); {1287#true} is VALID [2018-11-18 22:05:32,975 INFO L256 TraceCheckUtils]: 17: Hoare triple {1287#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1287#true} is VALID [2018-11-18 22:05:32,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1287#true} is VALID [2018-11-18 22:05:32,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {1287#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1287#true} is VALID [2018-11-18 22:05:32,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1287#true} is VALID [2018-11-18 22:05:32,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,976 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1287#true} {1287#true} #154#return; {1287#true} is VALID [2018-11-18 22:05:32,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {1287#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1287#true} is VALID [2018-11-18 22:05:32,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,977 INFO L273 TraceCheckUtils]: 25: Hoare triple {1287#true} assume !~bvsgt32(~len, 1bv32); {1287#true} is VALID [2018-11-18 22:05:32,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {1287#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1287#true} is VALID [2018-11-18 22:05:32,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-18 22:05:32,988 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1287#true} {1307#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {1307#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:32,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {1307#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:32,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:32,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:32,990 INFO L256 TraceCheckUtils]: 32: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1287#true} is VALID [2018-11-18 22:05:32,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {1287#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1393#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} is VALID [2018-11-18 22:05:32,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {1393#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} assume true; {1393#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} is VALID [2018-11-18 22:05:32,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {1393#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:33,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:33,002 INFO L273 TraceCheckUtils]: 37: Hoare triple {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:33,004 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1400#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} {1380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #146#return; {1288#false} is VALID [2018-11-18 22:05:33,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {1288#false} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1288#false} is VALID [2018-11-18 22:05:33,004 INFO L273 TraceCheckUtils]: 40: Hoare triple {1288#false} assume true; {1288#false} is VALID [2018-11-18 22:05:33,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !~bvsgt32(~i~0, 4294967295bv32); {1288#false} is VALID [2018-11-18 22:05:33,005 INFO L273 TraceCheckUtils]: 42: Hoare triple {1288#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1288#false} is VALID [2018-11-18 22:05:33,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {1288#false} assume true; {1288#false} is VALID [2018-11-18 22:05:33,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {1288#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1288#false} is VALID [2018-11-18 22:05:33,005 INFO L256 TraceCheckUtils]: 45: Hoare triple {1288#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1288#false} is VALID [2018-11-18 22:05:33,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {1288#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1288#false} is VALID [2018-11-18 22:05:33,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {1288#false} assume true; {1288#false} is VALID [2018-11-18 22:05:33,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {1288#false} assume !~bvsgt32(~index, 0bv32); {1288#false} is VALID [2018-11-18 22:05:33,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {1288#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1288#false} is VALID [2018-11-18 22:05:33,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {1288#false} assume true; {1288#false} is VALID [2018-11-18 22:05:33,006 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1288#false} {1288#false} #148#return; {1288#false} is VALID [2018-11-18 22:05:33,007 INFO L273 TraceCheckUtils]: 52: Hoare triple {1288#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1288#false} is VALID [2018-11-18 22:05:33,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2018-11-18 22:05:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 22:05:33,013 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:33,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:33,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:05:33,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-18 22:05:33,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:33,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:05:33,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:33,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:05:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:05:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:05:33,123 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-11-18 22:05:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:33,990 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-18 22:05:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:05:33,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-18 22:05:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:05:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-18 22:05:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:05:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-18 22:05:33,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-18 22:05:34,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:34,162 INFO L225 Difference]: With dead ends: 89 [2018-11-18 22:05:34,162 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 22:05:34,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:05:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 22:05:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-18 22:05:34,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:34,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 57 states. [2018-11-18 22:05:34,259 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 57 states. [2018-11-18 22:05:34,260 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 57 states. [2018-11-18 22:05:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:34,265 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-18 22:05:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-18 22:05:34,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:34,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:34,267 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 65 states. [2018-11-18 22:05:34,267 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 65 states. [2018-11-18 22:05:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:34,271 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-18 22:05:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-18 22:05:34,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:34,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:34,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:34,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 22:05:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-18 22:05:34,277 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 54 [2018-11-18 22:05:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:34,277 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 22:05:34,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:05:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 22:05:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 22:05:34,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:34,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:34,280 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:34,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash 881803571, now seen corresponding path program 1 times [2018-11-18 22:05:34,281 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:34,281 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:05:34,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:34,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:34,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2018-11-18 22:05:34,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {1792#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1792#true} is VALID [2018-11-18 22:05:34,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #156#return; {1792#true} is VALID [2018-11-18 22:05:34,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2018-11-18 22:05:34,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {1792#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1812#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,582 INFO L256 TraceCheckUtils]: 6: Hoare triple {1812#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1792#true} is VALID [2018-11-18 22:05:34,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {1792#true} ~len := #in~len;~data := #in~data; {1792#true} is VALID [2018-11-18 22:05:34,582 INFO L256 TraceCheckUtils]: 8: Hoare triple {1792#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1792#true} is VALID [2018-11-18 22:05:34,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {1792#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1792#true} is VALID [2018-11-18 22:05:34,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {1792#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1792#true} is VALID [2018-11-18 22:05:34,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {1792#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,584 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1792#true} {1792#true} #152#return; {1792#true} is VALID [2018-11-18 22:05:34,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {1792#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {1792#true} assume !!~bvsgt32(~len, 1bv32); {1792#true} is VALID [2018-11-18 22:05:34,585 INFO L256 TraceCheckUtils]: 17: Hoare triple {1792#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1792#true} is VALID [2018-11-18 22:05:34,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {1792#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1792#true} is VALID [2018-11-18 22:05:34,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {1792#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1792#true} is VALID [2018-11-18 22:05:34,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {1792#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,587 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1792#true} #154#return; {1792#true} is VALID [2018-11-18 22:05:34,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {1792#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1792#true} is VALID [2018-11-18 22:05:34,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {1792#true} assume !~bvsgt32(~len, 1bv32); {1792#true} is VALID [2018-11-18 22:05:34,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {1792#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,611 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1792#true} {1812#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {1812#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {1812#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,630 INFO L256 TraceCheckUtils]: 32: Hoare triple {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1792#true} is VALID [2018-11-18 22:05:34,630 INFO L273 TraceCheckUtils]: 33: Hoare triple {1792#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1792#true} is VALID [2018-11-18 22:05:34,630 INFO L273 TraceCheckUtils]: 34: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {1792#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1792#true} is VALID [2018-11-18 22:05:34,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,631 INFO L273 TraceCheckUtils]: 37: Hoare triple {1792#true} assume !~bvsgt32(~index, 0bv32); {1792#true} is VALID [2018-11-18 22:05:34,631 INFO L273 TraceCheckUtils]: 38: Hoare triple {1792#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1792#true} is VALID [2018-11-18 22:05:34,631 INFO L273 TraceCheckUtils]: 39: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,637 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1792#true} {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #146#return; {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:34,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {1885#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1922#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:05:34,640 INFO L273 TraceCheckUtils]: 42: Hoare triple {1922#(= main_~i~0 (_ bv0 32))} assume true; {1922#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:05:34,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {1922#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1793#false} is VALID [2018-11-18 22:05:34,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {1793#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1793#false} is VALID [2018-11-18 22:05:34,648 INFO L273 TraceCheckUtils]: 45: Hoare triple {1793#false} assume true; {1793#false} is VALID [2018-11-18 22:05:34,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {1793#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1793#false} is VALID [2018-11-18 22:05:34,648 INFO L256 TraceCheckUtils]: 47: Hoare triple {1793#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1793#false} is VALID [2018-11-18 22:05:34,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {1793#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1793#false} is VALID [2018-11-18 22:05:34,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {1793#false} assume true; {1793#false} is VALID [2018-11-18 22:05:34,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {1793#false} assume !~bvsgt32(~index, 0bv32); {1793#false} is VALID [2018-11-18 22:05:34,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {1793#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1793#false} is VALID [2018-11-18 22:05:34,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {1793#false} assume true; {1793#false} is VALID [2018-11-18 22:05:34,649 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1793#false} {1793#false} #148#return; {1793#false} is VALID [2018-11-18 22:05:34,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {1793#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1793#false} is VALID [2018-11-18 22:05:34,650 INFO L273 TraceCheckUtils]: 55: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2018-11-18 22:05:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:05:34,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:05:34,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2018-11-18 22:05:34,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {1793#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1793#false} is VALID [2018-11-18 22:05:34,898 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1792#true} {1793#false} #148#return; {1793#false} is VALID [2018-11-18 22:05:34,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,899 INFO L273 TraceCheckUtils]: 51: Hoare triple {1792#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1792#true} is VALID [2018-11-18 22:05:34,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {1792#true} assume !~bvsgt32(~index, 0bv32); {1792#true} is VALID [2018-11-18 22:05:34,899 INFO L273 TraceCheckUtils]: 49: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {1792#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1792#true} is VALID [2018-11-18 22:05:34,900 INFO L256 TraceCheckUtils]: 47: Hoare triple {1793#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1792#true} is VALID [2018-11-18 22:05:34,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {1793#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1793#false} is VALID [2018-11-18 22:05:34,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {1793#false} assume true; {1793#false} is VALID [2018-11-18 22:05:34,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {1793#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1793#false} is VALID [2018-11-18 22:05:34,901 INFO L273 TraceCheckUtils]: 43: Hoare triple {2001#(bvsgt main_~i~0 (_ bv4294967295 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1793#false} is VALID [2018-11-18 22:05:34,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {2001#(bvsgt main_~i~0 (_ bv4294967295 32))} assume true; {2001#(bvsgt main_~i~0 (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2001#(bvsgt main_~i~0 (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,903 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1792#true} {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #146#return; {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {1792#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1792#true} is VALID [2018-11-18 22:05:34,904 INFO L273 TraceCheckUtils]: 37: Hoare triple {1792#true} assume !~bvsgt32(~index, 0bv32); {1792#true} is VALID [2018-11-18 22:05:34,904 INFO L273 TraceCheckUtils]: 36: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,904 INFO L273 TraceCheckUtils]: 35: Hoare triple {1792#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1792#true} is VALID [2018-11-18 22:05:34,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {1792#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1792#true} is VALID [2018-11-18 22:05:34,905 INFO L256 TraceCheckUtils]: 32: Hoare triple {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1792#true} is VALID [2018-11-18 22:05:34,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} assume true; {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {2045#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2008#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,913 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1792#true} {2045#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} #144#return; {2045#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {1792#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {1792#true} assume !~bvsgt32(~len, 1bv32); {1792#true} is VALID [2018-11-18 22:05:34,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {1792#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1792#true} is VALID [2018-11-18 22:05:34,914 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1792#true} #154#return; {1792#true} is VALID [2018-11-18 22:05:34,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {1792#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {1792#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1792#true} is VALID [2018-11-18 22:05:34,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {1792#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1792#true} is VALID [2018-11-18 22:05:34,916 INFO L256 TraceCheckUtils]: 17: Hoare triple {1792#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1792#true} is VALID [2018-11-18 22:05:34,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {1792#true} assume !!~bvsgt32(~len, 1bv32); {1792#true} is VALID [2018-11-18 22:05:34,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {1792#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,917 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1792#true} {1792#true} #152#return; {1792#true} is VALID [2018-11-18 22:05:34,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {1792#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1792#true} is VALID [2018-11-18 22:05:34,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {1792#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1792#true} is VALID [2018-11-18 22:05:34,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {1792#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1792#true} is VALID [2018-11-18 22:05:34,918 INFO L256 TraceCheckUtils]: 8: Hoare triple {1792#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1792#true} is VALID [2018-11-18 22:05:34,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {1792#true} ~len := #in~len;~data := #in~data; {1792#true} is VALID [2018-11-18 22:05:34,919 INFO L256 TraceCheckUtils]: 6: Hoare triple {2045#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1792#true} is VALID [2018-11-18 22:05:34,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {1792#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2045#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-18 22:05:34,920 INFO L256 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2018-11-18 22:05:34,920 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #156#return; {1792#true} is VALID [2018-11-18 22:05:34,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2018-11-18 22:05:34,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {1792#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1792#true} is VALID [2018-11-18 22:05:34,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2018-11-18 22:05:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:05:34,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:05:34,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 22:05:34,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-18 22:05:34,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:34,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:05:35,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:35,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:05:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:05:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:05:35,033 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 8 states. [2018-11-18 22:05:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:36,034 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-18 22:05:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:05:36,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-18 22:05:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:05:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-18 22:05:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:05:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-18 22:05:36,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2018-11-18 22:05:36,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:36,289 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:05:36,290 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 22:05:36,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:05:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 22:05:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-11-18 22:05:36,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:36,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 60 states. [2018-11-18 22:05:36,392 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 60 states. [2018-11-18 22:05:36,393 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 60 states. [2018-11-18 22:05:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:36,397 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 22:05:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 22:05:36,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:36,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:36,398 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 76 states. [2018-11-18 22:05:36,398 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 76 states. [2018-11-18 22:05:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:36,402 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 22:05:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 22:05:36,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:36,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:36,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:36,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 22:05:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-18 22:05:36,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 56 [2018-11-18 22:05:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:36,406 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-18 22:05:36,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:05:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-18 22:05:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:05:36,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:36,407 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:36,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:36,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1461159704, now seen corresponding path program 2 times [2018-11-18 22:05:36,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:05:36,432 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:05:36,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:05:36,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:05:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:36,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:36,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {2503#true} call ULTIMATE.init(); {2503#true} is VALID [2018-11-18 22:05:36,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {2503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2503#true} is VALID [2018-11-18 22:05:36,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2503#true} {2503#true} #156#return; {2503#true} is VALID [2018-11-18 22:05:36,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {2503#true} call #t~ret17 := main(); {2503#true} is VALID [2018-11-18 22:05:36,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {2503#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,760 INFO L256 TraceCheckUtils]: 6: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {2503#true} is VALID [2018-11-18 22:05:36,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {2503#true} ~len := #in~len;~data := #in~data; {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L256 TraceCheckUtils]: 8: Hoare triple {2503#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {2503#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {2503#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {2503#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,761 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2503#true} {2503#true} #152#return; {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {2503#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {2503#true} assume !!~bvsgt32(~len, 1bv32); {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L256 TraceCheckUtils]: 17: Hoare triple {2503#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {2503#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2503#true} is VALID [2018-11-18 22:05:36,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {2503#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {2503#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2503#true} {2503#true} #154#return; {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {2503#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {2503#true} assume !~bvsgt32(~len, 1bv32); {2503#true} is VALID [2018-11-18 22:05:36,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {2503#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2503#true} is VALID [2018-11-18 22:05:36,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,764 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2503#true} {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,767 INFO L256 TraceCheckUtils]: 32: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2503#true} is VALID [2018-11-18 22:05:36,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {2503#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2503#true} is VALID [2018-11-18 22:05:36,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {2503#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2503#true} is VALID [2018-11-18 22:05:36,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {2503#true} assume !~bvsgt32(~index, 0bv32); {2503#true} is VALID [2018-11-18 22:05:36,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {2503#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2503#true} is VALID [2018-11-18 22:05:36,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,785 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2503#true} {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #146#return; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,795 INFO L256 TraceCheckUtils]: 44: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2503#true} is VALID [2018-11-18 22:05:36,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {2503#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2503#true} is VALID [2018-11-18 22:05:36,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {2503#true} assume !~bvsgt32(~index, 0bv32); {2503#true} is VALID [2018-11-18 22:05:36,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {2503#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2503#true} is VALID [2018-11-18 22:05:36,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {2503#true} assume true; {2503#true} is VALID [2018-11-18 22:05:36,796 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2503#true} {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #146#return; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,797 INFO L273 TraceCheckUtils]: 53: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {2523#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:36,799 INFO L256 TraceCheckUtils]: 57: Hoare triple {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2503#true} is VALID [2018-11-18 22:05:36,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {2503#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2684#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} is VALID [2018-11-18 22:05:36,800 INFO L273 TraceCheckUtils]: 59: Hoare triple {2684#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} assume true; {2684#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} is VALID [2018-11-18 22:05:36,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {2684#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:36,803 INFO L273 TraceCheckUtils]: 61: Hoare triple {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:36,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} assume true; {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:05:36,805 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2691#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} {2671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #148#return; {2504#false} is VALID [2018-11-18 22:05:36,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {2504#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2504#false} is VALID [2018-11-18 22:05:36,805 INFO L273 TraceCheckUtils]: 65: Hoare triple {2504#false} assume !false; {2504#false} is VALID [2018-11-18 22:05:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 22:05:36,811 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:05:36,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 22:05:36,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:36,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:05:36,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:36,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:05:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:05:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:05:36,893 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2018-11-18 22:05:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:37,522 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-18 22:05:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:05:37,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 22:05:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:05:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-18 22:05:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:05:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-18 22:05:37,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-18 22:05:37,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:37,663 INFO L225 Difference]: With dead ends: 85 [2018-11-18 22:05:37,663 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:05:37,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:05:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:05:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-18 22:05:37,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:37,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 68 states. [2018-11-18 22:05:37,742 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 68 states. [2018-11-18 22:05:37,742 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 68 states. [2018-11-18 22:05:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:37,745 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-18 22:05:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-18 22:05:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:37,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:37,746 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 72 states. [2018-11-18 22:05:37,746 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 72 states. [2018-11-18 22:05:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:37,750 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-18 22:05:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-18 22:05:37,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:37,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:37,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:37,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:05:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-11-18 22:05:37,754 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 66 [2018-11-18 22:05:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:37,754 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-11-18 22:05:37,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:05:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-11-18 22:05:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 22:05:37,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:37,755 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:05:37,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:37,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1583056686, now seen corresponding path program 1 times [2018-11-18 22:05:37,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:05:37,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:05:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:38,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:38,124 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 22:05:38,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:05:38,163 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:38,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:38,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:38,614 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 13 treesize of output 4 [2018-11-18 22:05:38,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-18 22:05:38,637 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:38,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:05:38,693 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 8 treesize of output 7 [2018-11-18 22:05:38,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-18 22:05:38,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-18 22:05:38,810 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 12 treesize of output 11 [2018-11-18 22:05:38,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:38,854 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 22:05:38,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-18 22:05:38,873 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:39,789 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 25 treesize of output 18 [2018-11-18 22:05:39,796 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 18 treesize of output 17 [2018-11-18 22:05:39,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:39,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:39,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:39,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-18 22:05:40,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-18 22:05:40,325 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 13 treesize of output 1 [2018-11-18 22:05:40,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:40,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:40,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:40,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-11-18 22:05:40,400 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:04,833 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 22:06:04,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:04,932 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 36 treesize of output 41 [2018-11-18 22:06:04,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 22:06:04,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:05,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:82, output treesize:69 [2018-11-18 22:06:05,049 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:18,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-18 22:06:18,708 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 48 treesize of output 35 [2018-11-18 22:06:18,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:18,772 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 35 treesize of output 16 [2018-11-18 22:06:18,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:18,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 9 [2018-11-18 22:06:18,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:18,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:19,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2018-11-18 22:06:19,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 22:06:19,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:19,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 22:06:19,927 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:20,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 22:06:20,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:21,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 22:06:21,168 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 22:06:21,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 22:06:21,742 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:21,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-18 22:06:21,749 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:22,024 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 43 treesize of output 37 [2018-11-18 22:06:22,029 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:22,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 22:06:22,441 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 22:06:22,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-11-18 22:06:22,616 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 22:06:22,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 23 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:22,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:22,642 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:95, output treesize:9 [2018-11-18 22:06:22,654 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:22,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2018-11-18 22:06:22,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3067#true} is VALID [2018-11-18 22:06:22,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2018-11-18 22:06:22,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #156#return; {3067#true} is VALID [2018-11-18 22:06:22,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret17 := main(); {3067#true} is VALID [2018-11-18 22:06:22,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {3067#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:06:22,791 INFO L256 TraceCheckUtils]: 6: Hoare triple {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {3067#true} is VALID [2018-11-18 22:06:22,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {3067#true} ~len := #in~len;~data := #in~data; {3067#true} is VALID [2018-11-18 22:06:22,791 INFO L256 TraceCheckUtils]: 8: Hoare triple {3067#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {3067#true} is VALID [2018-11-18 22:06:22,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {3067#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {3100#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:22,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {3100#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3100#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:22,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {3100#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3107#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:06:22,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {3107#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {3107#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:06:22,842 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3107#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {3067#true} #152#return; {3114#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:22,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {3114#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:06:22,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume true; {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:06:22,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:06:22,846 INFO L256 TraceCheckUtils]: 17: Hoare triple {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3128#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:22,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {3128#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {3132#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:22,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {3132#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3132#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:22,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {3132#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3139#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:06:22,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {3139#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {3139#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:06:22,851 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3139#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {3118#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #154#return; {3146#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-18 22:06:22,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {3146#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:06:22,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume true; {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:06:22,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:06:22,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {3150#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {3160#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-18 22:06:22,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {3160#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} assume true; {3160#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-18 22:06:22,863 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3160#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {3167#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-18 22:06:22,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {3167#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {3171#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,866 INFO L273 TraceCheckUtils]: 30: Hoare triple {3171#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume true; {3171#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {3171#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3178#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,869 INFO L256 TraceCheckUtils]: 32: Hoare triple {3178#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3182#(exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1)))} is VALID [2018-11-18 22:06:22,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {3182#(exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3186#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))} is VALID [2018-11-18 22:06:22,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {3186#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))} assume true; {3186#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))} is VALID [2018-11-18 22:06:22,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {3186#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-18 22:06:22,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume true; {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-18 22:06:22,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-18 22:06:22,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {3193#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {3203#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-18 22:06:22,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {3203#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} assume true; {3203#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-18 22:06:22,886 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3203#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv0 32))) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_1))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} {3178#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #146#return; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume true; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,897 INFO L256 TraceCheckUtils]: 44: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3223#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} is VALID [2018-11-18 22:06:22,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {3223#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} is VALID [2018-11-18 22:06:22,899 INFO L273 TraceCheckUtils]: 46: Hoare triple {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} assume true; {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} is VALID [2018-11-18 22:06:22,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} assume !~bvsgt32(~index, 0bv32); {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} is VALID [2018-11-18 22:06:22,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {3227#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (= |old(#memory_int)| |#memory_int|))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {3237#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)))} is VALID [2018-11-18 22:06:22,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {3237#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)))} assume true; {3237#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)))} is VALID [2018-11-18 22:06:22,941 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3237#(and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)))} {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} #146#return; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume true; {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume !~bvsgt32(~i~0, 4294967295bv32); {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {3210#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {3256#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {3256#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume true; {3256#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,956 INFO L273 TraceCheckUtils]: 56: Hoare triple {3256#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {3263#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} is VALID [2018-11-18 22:06:22,960 INFO L256 TraceCheckUtils]: 57: Hoare triple {3263#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3267#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-18 22:06:22,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {3267#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3271#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-18 22:06:22,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {3271#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))} assume true; {3271#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-18 22:06:22,964 INFO L273 TraceCheckUtils]: 60: Hoare triple {3271#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:06:22,966 INFO L273 TraceCheckUtils]: 61: Hoare triple {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} assume true; {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:06:22,967 INFO L273 TraceCheckUtils]: 62: Hoare triple {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} assume !~bvsgt32(~index, 0bv32); {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:06:22,970 INFO L273 TraceCheckUtils]: 63: Hoare triple {3278#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {3288#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-18 22:06:22,971 INFO L273 TraceCheckUtils]: 64: Hoare triple {3288#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume true; {3288#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-18 22:06:22,974 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3288#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) v_prenex_1) v_main_~s~0.base_BEFORE_CALL_3) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} {3263#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (exists ((v_prenex_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) v_prenex_1) main_~s~0.base)))} #148#return; {3295#(and (= (_ bv3 32) main_~expected~0) (= (_ bv3 32) |main_#t~ret16|))} is VALID [2018-11-18 22:06:22,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {3295#(and (= (_ bv3 32) main_~expected~0) (= (_ bv3 32) |main_#t~ret16|))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {3068#false} is VALID [2018-11-18 22:06:22,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2018-11-18 22:06:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:06:23,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:06:26,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:06:26,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:06:26,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:06:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:26,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:26,933 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 22:06:26,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:26,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:26,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:06:26,945 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:27,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:27,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:27,924 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 13 treesize of output 4 [2018-11-18 22:06:27,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:27,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:27,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-18 22:06:27,939 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:28,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:06:28,070 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 8 treesize of output 7 [2018-11-18 22:06:28,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:06:28,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:06:28,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-18 22:06:28,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-18 22:06:28,328 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 12 treesize of output 11 [2018-11-18 22:06:28,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,399 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 27 treesize of output 28 [2018-11-18 22:06:28,405 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 12 treesize of output 11 [2018-11-18 22:06:28,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:28,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:28,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:38 [2018-11-18 22:06:28,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:30,641 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 25 treesize of output 18 [2018-11-18 22:06:30,659 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 18 treesize of output 17 [2018-11-18 22:06:30,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:30,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:30,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:30,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:55 [2018-11-18 22:06:31,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-18 22:06:31,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 22:06:31,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:31,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:31,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:31,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:41 [2018-11-18 22:06:31,684 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:56,747 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 22:06:56,914 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 35 treesize of output 40 [2018-11-18 22:06:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 22:06:56,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:56,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:57,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:57,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:114, output treesize:101 [2018-11-18 22:06:57,080 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:07:12,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-18 22:07:12,090 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 48 treesize of output 29 [2018-11-18 22:07:12,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:12,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2018-11-18 22:07:12,145 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:12,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:12,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 85 [2018-11-18 22:07:12,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 22:07:12,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-11-18 22:07:15,262 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 41 treesize of output 36 [2018-11-18 22:07:15,267 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:17,482 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 45 treesize of output 40 [2018-11-18 22:07:17,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:18,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2018-11-18 22:07:18,605 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:20,859 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 41 treesize of output 36 [2018-11-18 22:07:20,861 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:22,017 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 53 treesize of output 48 [2018-11-18 22:07:22,022 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:23,166 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 48 treesize of output 43 [2018-11-18 22:07:23,169 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:24,229 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 43 treesize of output 38 [2018-11-18 22:07:24,233 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:25,266 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 45 treesize of output 40 [2018-11-18 22:07:25,270 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:26,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-18 22:07:26,296 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:27,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2018-11-18 22:07:27,420 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-11-18 22:07:28,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 22:07:28,599 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:28,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 22:07:28,628 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:29,810 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 17 treesize of output 12 [2018-11-18 22:07:29,812 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:29,821 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 30 treesize of output 25 [2018-11-18 22:07:29,822 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:29,831 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 29 treesize of output 24 [2018-11-18 22:07:29,833 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:30,759 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 41 treesize of output 36 [2018-11-18 22:07:30,761 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:31,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2018-11-18 22:07:31,844 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:32,735 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 40 treesize of output 35 [2018-11-18 22:07:32,737 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:33,528 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 38 treesize of output 33 [2018-11-18 22:07:33,530 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:34,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2018-11-18 22:07:34,383 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-11-18 22:07:35,182 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 30 treesize of output 25 [2018-11-18 22:07:35,184 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:35,192 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 21 treesize of output 16 [2018-11-18 22:07:35,193 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:35,203 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 21 treesize of output 16 [2018-11-18 22:07:35,206 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:35,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-11-18 22:07:35,926 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:37,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2018-11-18 22:07:37,404 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:38,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-18 22:07:38,069 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:38,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 22:07:38,735 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:39,276 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 17 treesize of output 12 [2018-11-18 22:07:39,277 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:39,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-18 22:07:39,290 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:39,626 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 49 treesize of output 44 [2018-11-18 22:07:39,628 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:40,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-18 22:07:40,020 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:40,741 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 34 treesize of output 29 [2018-11-18 22:07:40,743 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:40,981 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 18 treesize of output 13 [2018-11-18 22:07:40,983 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:41,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 22:07:41,214 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:41,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 33 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-18 22:07:41,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2018-11-18 22:07:41,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:41,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-18 22:07:41,732 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:42,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-11-18 22:07:42,266 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:42,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-18 22:07:42,773 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:43,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-18 22:07:43,228 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:43,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 22:07:43,689 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:44,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-11-18 22:07:44,158 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-11-18 22:07:44,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 22:07:44,565 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:44,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:44,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:44,935 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 22:07:44,944 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:45,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-18 22:07:45,232 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:45,629 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-11-18 22:07:45,636 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:45,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-18 22:07:45,764 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:45,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2018-11-18 22:07:45,867 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:45,903 INFO L267 ElimStorePlain]: Start of recursive call 41: 20 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 71 [2018-11-18 22:07:46,103 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 22:07:46,104 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:47,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:47,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:47,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-11-18 22:07:47,458 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:49,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 22:07:49,788 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-11-18 22:07:50,821 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:52,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 22:07:52,934 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:53,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-18 22:07:53,894 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:54,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-11-18 22:07:54,794 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-11-18 22:07:55,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-11-18 22:07:55,732 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:56,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:56,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:56,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-18 22:07:56,650 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:58,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:58,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:07:58,698 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 21 treesize of output 15 [2018-11-18 22:07:58,700 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:59,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-18 22:07:59,160 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:59,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 23 [2018-11-18 22:07:59,579 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:59,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 31 [2018-11-18 22:07:59,939 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 3 xjuncts. [2018-11-18 22:08:00,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-18 22:08:00,274 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:00,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-18 22:08:00,375 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:00,456 INFO L267 ElimStorePlain]: Start of recursive call 54: 33 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:00,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-18 22:08:00,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:00,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:00,657 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 41 [2018-11-18 22:08:00,665 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,293 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 41 treesize of output 37 [2018-11-18 22:08:01,296 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:01,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:01,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-18 22:08:01,927 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:02,468 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 45 treesize of output 41 [2018-11-18 22:08:02,517 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:03,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-11-18 22:08:03,339 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:03,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:03,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:03,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2018-11-18 22:08:03,948 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-18 22:08:04,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-18 22:08:04,433 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:04,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-18 22:08:04,883 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:05,259 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 45 treesize of output 41 [2018-11-18 22:08:05,262 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:05,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-11-18 22:08:05,631 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 34 [2018-11-18 22:08:06,036 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 21 [2018-11-18 22:08:06,346 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,503 INFO L267 ElimStorePlain]: Start of recursive call 70: 20 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 63 [2018-11-18 22:08:06,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-18 22:08:06,610 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,792 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 47 treesize of output 41 [2018-11-18 22:08:06,800 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:06,981 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 43 treesize of output 38 [2018-11-18 22:08:06,988 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-18 22:08:07,154 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 34 [2018-11-18 22:08:07,316 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 25 [2018-11-18 22:08:07,456 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 22:08:07,595 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,650 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 15 treesize of output 10 [2018-11-18 22:08:07,652 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-18 22:08:07,699 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:07,729 INFO L267 ElimStorePlain]: Start of recursive call 83: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:08:07,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2018-11-18 22:08:07,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 22:08:07,880 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:08,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-18 22:08:08,487 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:09,045 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 54 treesize of output 48 [2018-11-18 22:08:09,049 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:09,564 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 43 treesize of output 39 [2018-11-18 22:08:09,568 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:10,080 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 34 treesize of output 29 [2018-11-18 22:08:10,082 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:10,584 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 46 treesize of output 42 [2018-11-18 22:08:10,588 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:11,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 30 treesize of output 25 [2018-11-18 22:08:11,059 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:11,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:11,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:11,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-18 22:08:11,493 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:11,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-18 22:08:11,920 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:12,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-18 22:08:12,281 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:12,572 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 17 treesize of output 12 [2018-11-18 22:08:12,574 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:12,718 INFO L267 ElimStorePlain]: Start of recursive call 93: 20 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:12,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2018-11-18 22:08:12,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-18 22:08:12,888 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:13,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 22:08:13,481 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:14,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-18 22:08:14,075 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:14,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-18 22:08:14,588 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:15,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-18 22:08:15,122 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:15,581 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 54 treesize of output 48 [2018-11-18 22:08:15,586 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:16,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2018-11-18 22:08:16,038 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 2 xjuncts. [2018-11-18 22:08:16,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:16,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:16,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-18 22:08:16,487 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:16,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 22:08:16,879 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,049 INFO L267 ElimStorePlain]: Start of recursive call 105: 20 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2018-11-18 22:08:17,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-18 22:08:17,348 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:17,711 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 30 treesize of output 25 [2018-11-18 22:08:17,713 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:18,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 22:08:18,715 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:19,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-18 22:08:19,032 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-11-18 22:08:19,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 12 [2018-11-18 22:08:19,561 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2018-11-18 22:08:19,704 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 46 treesize of output 40 [2018-11-18 22:08:19,708 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:19,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-18 22:08:19,919 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:19,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 22:08:19,995 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,216 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 9 treesize of output 3 [2018-11-18 22:08:20,217 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,239 INFO L267 ElimStorePlain]: Start of recursive call 115: 20 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 59 [2018-11-18 22:08:20,332 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 47 treesize of output 42 [2018-11-18 22:08:20,334 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,549 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 42 treesize of output 36 [2018-11-18 22:08:20,552 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 22:08:20,740 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:20,898 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-18 22:08:20,903 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,032 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 22 treesize of output 17 [2018-11-18 22:08:21,034 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,156 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 20 treesize of output 15 [2018-11-18 22:08:21,158 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:21,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:08:21,272 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 27 treesize of output 21 [2018-11-18 22:08:21,274 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-18 22:08:21,374 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 22:08:21,480 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 22:08:21,556 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,566 INFO L267 ElimStorePlain]: Start of recursive call 125: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:08:21,571 INFO L202 ElimStorePlain]: Needed 135 recursive calls to eliminate 9 variables, input treesize:131, output treesize:9 [2018-11-18 22:08:21,585 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:08:21,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2018-11-18 22:08:21,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3067#true} is VALID [2018-11-18 22:08:21,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2018-11-18 22:08:21,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #156#return; {3067#true} is VALID [2018-11-18 22:08:21,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret17 := main(); {3067#true} is VALID [2018-11-18 22:08:21,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {3067#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:08:21,588 INFO L256 TraceCheckUtils]: 6: Hoare triple {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {3067#true} is VALID [2018-11-18 22:08:21,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {3067#true} ~len := #in~len;~data := #in~data; {3067#true} is VALID [2018-11-18 22:08:21,588 INFO L256 TraceCheckUtils]: 8: Hoare triple {3067#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {3067#true} is VALID [2018-11-18 22:08:21,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {3067#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {3391#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:08:21,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {3391#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3391#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:08:21,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {3391#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3398#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:21,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {3398#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {3398#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:08:21,593 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3398#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {3067#true} #152#return; {3405#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:08:21,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {3405#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:08:21,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume true; {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:08:21,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-18 22:08:21,597 INFO L256 TraceCheckUtils]: 17: Hoare triple {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {3128#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:08:21,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {3128#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {3422#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-18 22:08:21,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {3422#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {3422#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-18 22:08:21,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {3422#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3429#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-18 22:08:21,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {3429#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} assume true; {3429#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-18 22:08:21,603 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3429#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} {3409#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #154#return; {3436#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-18 22:08:21,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {3436#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:08:21,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume true; {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:08:21,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:08:21,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {3440#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {3450#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} is VALID [2018-11-18 22:08:21,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {3450#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} assume true; {3450#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} is VALID [2018-11-18 22:08:21,614 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3450#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} {3087#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #144#return; {3457#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset) |main_#t~ret13.base|) (= |main_#t~ret13.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {3457#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset) |main_#t~ret13.base|) (= |main_#t~ret13.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {3461#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {3461#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume true; {3461#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {3461#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3468#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,622 INFO L256 TraceCheckUtils]: 32: Hoare triple {3468#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3472#(exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset))))} is VALID [2018-11-18 22:08:21,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3476#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {3476#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} assume true; {3476#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {3476#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} assume true; {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} assume !~bvsgt32(~index, 0bv32); {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,632 INFO L273 TraceCheckUtils]: 38: Hoare triple {3483#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {3493#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {3493#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} assume true; {3493#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} is VALID [2018-11-18 22:08:21,638 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3493#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|) (exists ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_6 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6) v_main_~s~0.base_BEFORE_CALL_7)) (= v_main_~s~0.offset_BEFORE_CALL_6 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)) (= v_main_~s~0.base_BEFORE_CALL_7 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_6)) sll_circular_create_~last~0.offset)))))} {3468#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #146#return; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume true; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,650 INFO L256 TraceCheckUtils]: 44: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3513#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {3513#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} assume true; {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} assume !~bvsgt32(~index, 0bv32); {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {3517#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= |old(#memory_int)| |#memory_int|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {3527#(and (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,656 INFO L273 TraceCheckUtils]: 49: Hoare triple {3527#(and (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} assume true; {3527#(and (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} is VALID [2018-11-18 22:08:21,661 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3527#(and (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|)) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (and (= v_main_~s~0.base_BEFORE_CALL_8 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_7) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) v_main_~s~0.offset_BEFORE_CALL_7) v_main_~s~0.base_BEFORE_CALL_8)))))} {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #146#return; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume true; {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume !~bvsgt32(~i~0, 4294967295bv32); {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,670 INFO L273 TraceCheckUtils]: 54: Hoare triple {3500#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {3546#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {3546#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume true; {3546#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {3546#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd (bvneg main_~len~0) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {3553#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-18 22:08:21,676 INFO L256 TraceCheckUtils]: 57: Hoare triple {3553#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3557#(exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8)))} is VALID [2018-11-18 22:08:21,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {3557#(exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3561#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {3561#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} assume true; {3561#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,678 INFO L273 TraceCheckUtils]: 60: Hoare triple {3561#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} assume true; {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,681 INFO L273 TraceCheckUtils]: 62: Hoare triple {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} assume !~bvsgt32(~index, 0bv32); {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,684 INFO L273 TraceCheckUtils]: 63: Hoare triple {3568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {3578#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,685 INFO L273 TraceCheckUtils]: 64: Hoare triple {3578#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} assume true; {3578#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} is VALID [2018-11-18 22:08:21,690 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3578#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_8 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.base_BEFORE_CALL_9) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8) v_main_~s~0.base_BEFORE_CALL_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_8)) sll_circular_create_~last~0.offset) v_main_~s~0.offset_BEFORE_CALL_8))))} {3553#(and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32)))) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #148#return; {3295#(and (= (_ bv3 32) main_~expected~0) (= (_ bv3 32) |main_#t~ret16|))} is VALID [2018-11-18 22:08:21,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {3295#(and (= (_ bv3 32) main_~expected~0) (= (_ bv3 32) |main_#t~ret16|))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {3068#false} is VALID [2018-11-18 22:08:21,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2018-11-18 22:08:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:08:21,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:08:23,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:08:23,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2018-11-18 22:08:23,612 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 68 [2018-11-18 22:08:23,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:08:23,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-18 22:08:23,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:08:23,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-18 22:08:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-18 22:08:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4284, Unknown=36, NotChecked=0, Total=4556 [2018-11-18 22:08:24,001 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 57 states.