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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:12:02,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:12:02,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:12:02,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:12:02,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:12:02,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:12:02,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:12:02,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:12:02,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:12:02,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:12:02,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:12:02,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:12:02,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:12:02,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:12:03,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:12:03,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:12:03,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:12:03,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:12:03,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:12:03,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:12:03,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:12:03,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:12:03,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:12:03,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:12:03,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:12:03,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:12:03,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:12:03,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:12:03,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:12:03,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:12:03,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:12:03,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:12:03,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:12:03,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:12:03,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:12:03,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:12:03,020 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-23 11:12:03,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:12:03,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:12:03,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:12:03,044 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:12:03,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:12:03,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:12:03,045 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:12:03,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:12:03,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:12:03,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:12:03,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:12:03,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:12:03,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:12:03,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:12:03,047 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:12:03,047 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:12:03,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:12:03,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:12:03,048 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:12:03,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:12:03,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:12:03,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:12:03,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:12:03,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:12:03,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:12:03,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:12:03,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:12:03,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:12:03,049 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:12:03,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:12:03,050 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:12:03,050 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:12:03,050 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:12:03,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:12:03,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:12:03,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:12:03,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:12:03,117 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:12:03,118 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:03,182 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0759b9134/ce26353a4952438181863f482ecede5c/FLAG9d4c84381 [2018-11-23 11:12:03,737 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:12:03,738 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:03,754 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0759b9134/ce26353a4952438181863f482ecede5c/FLAG9d4c84381 [2018-11-23 11:12:04,022 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0759b9134/ce26353a4952438181863f482ecede5c [2018-11-23 11:12:04,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:12:04,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:12:04,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:04,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:12:04,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:12:04,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf8575b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04, skipping insertion in model container [2018-11-23 11:12:04,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:12:04,102 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:12:04,559 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:04,576 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:12:04,758 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:04,836 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:12:04,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04 WrapperNode [2018-11-23 11:12:04,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:04,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:04,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:12:04,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:12:04,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:04,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:12:04,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:12:04,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:12:04,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (1/1) ... [2018-11-23 11:12:04,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:12:04,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:12:04,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:12:04,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:12:04,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (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-23 11:12:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 11:12:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 11:12:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:12:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:12:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:12:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:12:05,068 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:12:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:12:05,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:12:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:12:05,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:12:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:12:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:12:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:12:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:12:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:12:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_first [2018-11-23 11:12:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_first [2018-11-23 11:12:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:12:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:12:06,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:12:06,334 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:12:06,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:06 BoogieIcfgContainer [2018-11-23 11:12:06,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:12:06,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:12:06,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:12:06,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:12:06,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:12:04" (1/3) ... [2018-11-23 11:12:06,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a843cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:06, skipping insertion in model container [2018-11-23 11:12:06,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (2/3) ... [2018-11-23 11:12:06,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a843cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:06, skipping insertion in model container [2018-11-23 11:12:06,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:06" (3/3) ... [2018-11-23 11:12:06,343 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:06,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:12:06,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:12:06,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:12:06,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:12:06,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:12:06,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:12:06,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:12:06,429 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:12:06,429 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:12:06,429 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:12:06,429 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:12:06,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:12:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:12:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:12:06,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:06,469 INFO L402 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] [2018-11-23 11:12:06,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:06,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 455427356, now seen corresponding path program 1 times [2018-11-23 11:12:06,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:06,481 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-23 11:12:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:06,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:06,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:12:06,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-23 11:12:06,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:12:06,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #89#return; {45#true} is VALID [2018-11-23 11:12:06,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret16 := main(); {45#true} is VALID [2018-11-23 11:12:06,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {45#true} is VALID [2018-11-23 11:12:06,896 INFO L256 TraceCheckUtils]: 6: Hoare triple {45#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {45#true} is VALID [2018-11-23 11:12:06,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#true} ~len := #in~len;~data := #in~data; {45#true} is VALID [2018-11-23 11:12:06,897 INFO L256 TraceCheckUtils]: 8: Hoare triple {45#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {45#true} is VALID [2018-11-23 11:12:06,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {45#true} is VALID [2018-11-23 11:12:06,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {45#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {45#true} is VALID [2018-11-23 11:12:06,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {45#true} is VALID [2018-11-23 11:12:06,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:12:06,899 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {45#true} {45#true} #85#return; {45#true} is VALID [2018-11-23 11:12:06,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {45#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; {45#true} is VALID [2018-11-23 11:12:06,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:12:06,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {46#false} is VALID [2018-11-23 11:12:06,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-23 11:12:06,914 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {46#false} {45#true} #81#return; {46#false} is VALID [2018-11-23 11:12:06,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {46#false} is VALID [2018-11-23 11:12:06,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume !~bvslt32(~i~0, ~len~0); {46#false} is VALID [2018-11-23 11:12:06,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {46#false} is VALID [2018-11-23 11:12:06,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {46#false} is VALID [2018-11-23 11:12:06,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:12:06,922 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-23 11:12:06,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:06,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:06,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:12:06,941 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:12:06,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:06,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:12:07,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:12:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:12:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:12:07,095 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:12:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:07,559 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 11:12:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:12:07,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:12:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 11:12:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 11:12:07,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2018-11-23 11:12:08,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:08,263 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:12:08,264 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:12:08,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-23 11:12:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:12:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:12:08,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:08,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:08,338 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:08,338 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:08,344 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:12:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:08,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:08,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:08,346 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:08,346 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:08,352 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:12:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:08,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:08,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:08,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:08,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:12:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 11:12:08,359 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-11-23 11:12:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:08,360 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 11:12:08,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:12:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:12:08,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:08,362 INFO L402 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] [2018-11-23 11:12:08,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:08,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1817468401, now seen corresponding path program 1 times [2018-11-23 11:12:08,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:08,364 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-23 11:12:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:08,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 11:12:08,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {319#true} is VALID [2018-11-23 11:12:08,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:12:08,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #89#return; {319#true} is VALID [2018-11-23 11:12:08,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret16 := main(); {319#true} is VALID [2018-11-23 11:12:08,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:08,635 INFO L256 TraceCheckUtils]: 6: Hoare triple {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {319#true} is VALID [2018-11-23 11:12:08,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#true} ~len := #in~len;~data := #in~data; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,636 INFO L256 TraceCheckUtils]: 8: Hoare triple {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {319#true} is VALID [2018-11-23 11:12:08,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {319#true} is VALID [2018-11-23 11:12:08,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {319#true} is VALID [2018-11-23 11:12:08,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {319#true} is VALID [2018-11-23 11:12:08,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:12:08,638 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {319#true} {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #85#return; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#(= |dll_circular_create_#in~len| dll_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; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,644 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {320#false} is VALID [2018-11-23 11:12:08,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {320#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {320#false} is VALID [2018-11-23 11:12:08,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {320#false} assume !~bvslt32(~i~0, ~len~0); {320#false} is VALID [2018-11-23 11:12:08,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {320#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {320#false} is VALID [2018-11-23 11:12:08,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {320#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {320#false} is VALID [2018-11-23 11:12:08,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 11:12:08,648 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-23 11:12:08,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:08,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:08,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:12:08,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:12:08,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:08,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:12:08,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:08,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:12:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:12:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:12:08,786 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-23 11:12:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,394 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:12:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:12:10,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:12:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 11:12:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 11:12:10,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-23 11:12:10,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:10,523 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:12:10,524 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:12:10,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:12:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:12:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 11:12:10,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:10,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:10,550 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:10,550 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,555 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:12:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:12:10,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:10,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:10,556 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 11:12:10,556 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 11:12:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,561 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:12:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:12:10,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:10,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:10,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:10,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:12:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 11:12:10,566 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-11-23 11:12:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:10,566 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 11:12:10,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:12:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:12:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:12:10,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:10,568 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:12:10,568 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:10,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1351512963, now seen corresponding path program 1 times [2018-11-23 11:12:10,570 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:10,570 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-23 11:12:10,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:10,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:10,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 11:12:10,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {603#true} is VALID [2018-11-23 11:12:10,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:10,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #89#return; {603#true} is VALID [2018-11-23 11:12:10,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret16 := main(); {603#true} is VALID [2018-11-23 11:12:10,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:10,801 INFO L256 TraceCheckUtils]: 6: Hoare triple {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {603#true} is VALID [2018-11-23 11:12:10,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#true} ~len := #in~len;~data := #in~data; {603#true} is VALID [2018-11-23 11:12:10,801 INFO L256 TraceCheckUtils]: 8: Hoare triple {603#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {603#true} is VALID [2018-11-23 11:12:10,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {603#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {603#true} is VALID [2018-11-23 11:12:10,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {603#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {603#true} is VALID [2018-11-23 11:12:10,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {603#true} is VALID [2018-11-23 11:12:10,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:10,803 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {603#true} {603#true} #85#return; {603#true} is VALID [2018-11-23 11:12:10,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:10,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {603#true} assume !!~bvsgt32(~len, 1bv32); {603#true} is VALID [2018-11-23 11:12:10,804 INFO L256 TraceCheckUtils]: 16: Hoare triple {603#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {603#true} is VALID [2018-11-23 11:12:10,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {603#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {603#true} is VALID [2018-11-23 11:12:10,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {603#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {603#true} is VALID [2018-11-23 11:12:10,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {603#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {603#true} is VALID [2018-11-23 11:12:10,805 INFO L273 TraceCheckUtils]: 20: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:10,805 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {603#true} {603#true} #87#return; {603#true} is VALID [2018-11-23 11:12:10,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {603#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); {603#true} is VALID [2018-11-23 11:12:10,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {603#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {603#true} is VALID [2018-11-23 11:12:10,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {603#true} ~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; {603#true} is VALID [2018-11-23 11:12:10,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {603#true} assume !~bvsgt32(~len, 1bv32); {603#true} is VALID [2018-11-23 11:12:10,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {603#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {603#true} is VALID [2018-11-23 11:12:10,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:10,808 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {603#true} {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:10,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {696#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:10,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {604#false} is VALID [2018-11-23 11:12:10,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {604#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {604#false} is VALID [2018-11-23 11:12:10,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {604#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {604#false} is VALID [2018-11-23 11:12:10,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 11:12:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:12:10,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:10,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:10,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:12:10,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:12:10,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:10,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:12:10,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:10,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:12:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:12:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:12:10,905 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-11-23 11:12:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,652 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:12:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:12:12,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:12:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:12:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:12:12,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-23 11:12:12,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:12,745 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:12:12,745 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:12:12,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:12:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:12:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 11:12:12,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:12,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:12,770 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:12,771 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,775 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:12:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:12:12,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,777 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 11:12:12,777 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 11:12:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,780 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:12:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:12:12,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:12,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:12:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 11:12:12,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2018-11-23 11:12:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:12,785 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 11:12:12,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:12:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 11:12:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:12:12,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:12,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:12:12,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:12,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1470377022, now seen corresponding path program 1 times [2018-11-23 11:12:12,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:12,789 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-23 11:12:12,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:12,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:13,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:12:13,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {900#true} is VALID [2018-11-23 11:12:13,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #89#return; {900#true} is VALID [2018-11-23 11:12:13,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret16 := main(); {900#true} is VALID [2018-11-23 11:12:13,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:13,091 INFO L256 TraceCheckUtils]: 6: Hoare triple {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {900#true} is VALID [2018-11-23 11:12:13,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#true} ~len := #in~len;~data := #in~data; {900#true} is VALID [2018-11-23 11:12:13,092 INFO L256 TraceCheckUtils]: 8: Hoare triple {900#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:13,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {900#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {900#true} is VALID [2018-11-23 11:12:13,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:13,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {900#true} is VALID [2018-11-23 11:12:13,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,093 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {900#true} {900#true} #85#return; {900#true} is VALID [2018-11-23 11:12:13,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:13,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} assume !!~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:13,094 INFO L256 TraceCheckUtils]: 16: Hoare triple {900#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:13,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {900#true} is VALID [2018-11-23 11:12:13,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:13,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {900#true} is VALID [2018-11-23 11:12:13,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,095 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {900#true} {900#true} #87#return; {900#true} is VALID [2018-11-23 11:12:13,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:13,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {900#true} is VALID [2018-11-23 11:12:13,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} ~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; {900#true} is VALID [2018-11-23 11:12:13,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:13,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {900#true} is VALID [2018-11-23 11:12:13,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,101 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {900#true} {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:13,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:13,102 INFO L273 TraceCheckUtils]: 30: Hoare triple {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0); {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:13,103 INFO L256 TraceCheckUtils]: 31: Hoare triple {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {900#true} is VALID [2018-11-23 11:12:13,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {900#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:13,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {900#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:13,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,104 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {900#true} {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #83#return; {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:13,105 INFO L273 TraceCheckUtils]: 36: Hoare triple {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1015#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:13,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {1015#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {901#false} is VALID [2018-11-23 11:12:13,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {901#false} is VALID [2018-11-23 11:12:13,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {901#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {901#false} is VALID [2018-11-23 11:12:13,107 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:12:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:12:13,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:13,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:12:13,312 INFO L273 TraceCheckUtils]: 39: Hoare triple {901#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {901#false} is VALID [2018-11-23 11:12:13,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {901#false} is VALID [2018-11-23 11:12:13,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {1037#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {901#false} is VALID [2018-11-23 11:12:13,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1037#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:12:13,320 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {900#true} {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #83#return; {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {900#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:13,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {900#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:13,322 INFO L256 TraceCheckUtils]: 31: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {900#true} is VALID [2018-11-23 11:12:13,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0); {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {1063#(bvslt (_ bv1 32) main_~len~0)} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,324 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {900#true} {1063#(bvslt (_ bv1 32) main_~len~0)} #81#return; {1063#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:13,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {900#true} is VALID [2018-11-23 11:12:13,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:13,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} ~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; {900#true} is VALID [2018-11-23 11:12:13,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {900#true} is VALID [2018-11-23 11:12:13,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:13,326 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {900#true} {900#true} #87#return; {900#true} is VALID [2018-11-23 11:12:13,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {900#true} is VALID [2018-11-23 11:12:13,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:13,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {900#true} is VALID [2018-11-23 11:12:13,328 INFO L256 TraceCheckUtils]: 16: Hoare triple {900#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:13,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} assume !!~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:13,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:13,329 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {900#true} {900#true} #85#return; {900#true} is VALID [2018-11-23 11:12:13,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {900#true} is VALID [2018-11-23 11:12:13,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:13,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {900#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {900#true} is VALID [2018-11-23 11:12:13,331 INFO L256 TraceCheckUtils]: 8: Hoare triple {900#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:13,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#true} ~len := #in~len;~data := #in~data; {900#true} is VALID [2018-11-23 11:12:13,331 INFO L256 TraceCheckUtils]: 6: Hoare triple {1063#(bvslt (_ bv1 32) main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {900#true} is VALID [2018-11-23 11:12:13,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1063#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:13,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret16 := main(); {900#true} is VALID [2018-11-23 11:12:13,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #89#return; {900#true} is VALID [2018-11-23 11:12:13,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:13,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {900#true} is VALID [2018-11-23 11:12:13,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:12:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:12:13,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:13,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:12:13,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:12:13,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:13,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:12:13,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:13,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:12:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:12:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:12:13,484 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 11:12:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:15,521 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 11:12:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:12:15,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:12:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 11:12:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 11:12:15,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-23 11:12:15,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:15,701 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:12:15,701 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:12:15,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:12:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 11:12:15,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:15,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:15,755 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:15,755 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:15,759 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:12:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:12:15,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:15,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:15,760 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 11:12:15,760 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 11:12:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:15,764 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:12:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:12:15,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:15,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:15,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:15,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:12:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 11:12:15,768 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2018-11-23 11:12:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:15,769 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 11:12:15,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:12:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:12:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:12:15,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:15,771 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:12:15,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:15,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -659866845, now seen corresponding path program 2 times [2018-11-23 11:12:15,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:15,772 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-23 11:12:15,791 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:12:15,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:12:15,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:12:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:16,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:16,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:12:16,252 INFO L478 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-23 11:12:16,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:12:16,282 INFO L478 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-23 11:12:16,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-23 11:12:16,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:12:16,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:12:16,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:12:16,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:12:16,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:16,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:12:16,542 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:16,543 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, |main_~#s~0.base|, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (and (= |main_#t~mem15.offset| .cse0) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= |main_#t~mem15.base| .cse1))) [2018-11-23 11:12:16,543 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32))) [2018-11-23 11:12:16,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1363#true} is VALID [2018-11-23 11:12:16,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {1363#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1363#true} is VALID [2018-11-23 11:12:16,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:16,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #89#return; {1363#true} is VALID [2018-11-23 11:12:16,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret16 := main(); {1363#true} is VALID [2018-11-23 11:12:16,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {1363#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,570 INFO L256 TraceCheckUtils]: 6: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1363#true} is VALID [2018-11-23 11:12:16,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {1363#true} ~len := #in~len;~data := #in~data; {1363#true} is VALID [2018-11-23 11:12:16,570 INFO L256 TraceCheckUtils]: 8: Hoare triple {1363#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1363#true} is VALID [2018-11-23 11:12:16,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1363#true} is VALID [2018-11-23 11:12:16,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {1363#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1363#true} is VALID [2018-11-23 11:12:16,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {1363#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1363#true} is VALID [2018-11-23 11:12:16,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:16,572 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1363#true} {1363#true} #85#return; {1363#true} is VALID [2018-11-23 11:12:16,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {1363#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; {1363#true} is VALID [2018-11-23 11:12:16,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {1363#true} assume !!~bvsgt32(~len, 1bv32); {1363#true} is VALID [2018-11-23 11:12:16,573 INFO L256 TraceCheckUtils]: 16: Hoare triple {1363#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1363#true} is VALID [2018-11-23 11:12:16,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {1363#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1363#true} is VALID [2018-11-23 11:12:16,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {1363#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1363#true} is VALID [2018-11-23 11:12:16,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {1363#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1363#true} is VALID [2018-11-23 11:12:16,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:16,575 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1363#true} {1363#true} #87#return; {1363#true} is VALID [2018-11-23 11:12:16,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {1363#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); {1363#true} is VALID [2018-11-23 11:12:16,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {1363#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1363#true} is VALID [2018-11-23 11:12:16,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {1363#true} ~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; {1363#true} is VALID [2018-11-23 11:12:16,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {1363#true} assume !~bvsgt32(~len, 1bv32); {1363#true} is VALID [2018-11-23 11:12:16,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {1363#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1363#true} is VALID [2018-11-23 11:12:16,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:16,580 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1363#true} {1383#(= |main_~#s~0.offset| (_ bv0 32))} #81#return; {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,585 INFO L256 TraceCheckUtils]: 31: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1363#true} is VALID [2018-11-23 11:12:16,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {1363#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1363#true} is VALID [2018-11-23 11:12:16,586 INFO L273 TraceCheckUtils]: 33: Hoare triple {1363#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1363#true} is VALID [2018-11-23 11:12:16,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:16,588 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1363#true} {1383#(= |main_~#s~0.offset| (_ bv0 32))} #83#return; {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,589 INFO L273 TraceCheckUtils]: 36: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:16,593 INFO L256 TraceCheckUtils]: 38: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1363#true} is VALID [2018-11-23 11:12:16,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {1363#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1486#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|))} is VALID [2018-11-23 11:12:16,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {1486#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|))} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1490#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-23 11:12:16,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {1490#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} assume true; {1490#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-23 11:12:16,642 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1490#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} {1383#(= |main_~#s~0.offset| (_ bv0 32))} #83#return; {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:16,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:16,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !~bvslt32(~i~0, ~len~0); {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:16,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {1497#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1507#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} is VALID [2018-11-23 11:12:16,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {1507#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1364#false} is VALID [2018-11-23 11:12:16,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2018-11-23 11:12:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:12:16,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:12:16,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 11:12:16,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:16,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:12:16,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:16,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:12:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:12:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:12:16,779 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-11-23 11:12:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:19,734 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 11:12:19,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:12:19,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 11:12:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:12:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:12:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:12:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:12:19,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-23 11:12:19,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:19,874 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:12:19,874 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:12:19,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:12:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-11-23 11:12:19,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:19,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2018-11-23 11:12:19,914 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2018-11-23 11:12:19,914 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2018-11-23 11:12:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:19,919 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:12:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 11:12:19,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:19,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:19,920 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2018-11-23 11:12:19,920 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2018-11-23 11:12:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:19,924 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:12:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 11:12:19,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:19,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:19,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:19,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:12:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 11:12:19,929 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 48 [2018-11-23 11:12:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:19,929 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 11:12:19,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:12:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:12:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:12:19,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:19,931 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:12:19,932 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:19,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213471, now seen corresponding path program 1 times [2018-11-23 11:12:19,933 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:19,933 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-23 11:12:19,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:12:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:20,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:20,402 INFO L478 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-23 11:12:20,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:12:20,411 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:20,411 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_52|]. (= |#valid| (store |v_#valid_52| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:12:20,412 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:12:20,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:20,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:20,666 INFO L478 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-23 11:12:20,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:12:20,683 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:20,683 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_2|]. (and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_2| dll_circular_create_~head~0.base) (_ bv1 1))) (= (_ bv0 1) (select |v_#valid_BEFORE_CALL_2| |dll_circular_create_#t~ret4.base|)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:20,683 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:20,733 INFO L478 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-23 11:12:20,739 INFO L478 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-23 11:12:20,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 11:12:20,931 INFO L478 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 21 treesize of output 22 [2018-11-23 11:12:20,937 INFO L478 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 10 treesize of output 9 [2018-11-23 11:12:20,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,973 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-23 11:12:20,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:12:20,988 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:20,989 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_57|, dll_circular_create_~head~0.offset]. (and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= (select (select |v_#memory_$Pointer$.base_57| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset) dll_circular_create_~last~0.base) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| dll_circular_create_~last~0.base (store (select |v_#memory_$Pointer$.base_57| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)))) [2018-11-23 11:12:20,989 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~head~0.offset]. (and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) [2018-11-23 11:12:21,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 11:12:21,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-23 11:12:21,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:21,406 INFO L478 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 50 treesize of output 40 [2018-11-23 11:12:21,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:21,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 11:12:21,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:21,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:21,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:21,509 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-23 11:12:21,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-11-23 11:12:21,564 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:21,565 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_58|, dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse1 (select (select |v_#memory_$Pointer$.base_58| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|))) (let ((.cse2 (select |v_#memory_$Pointer$.base_58| .cse1))) (and (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_58| .cse1 (store .cse2 dll_circular_create_~last~0.offset |dll_circular_create_#res.base|)))) (store .cse0 |dll_circular_create_#res.base| (store (select .cse0 |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)) .cse1)))) (= (select .cse2 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|) (= (_ bv0 32) |dll_circular_create_#res.offset|) (not (= .cse1 |dll_circular_create_#res.base|))))) [2018-11-23 11:12:21,565 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|))) (let ((.cse0 (select .cse1 |dll_circular_create_#res.offset|))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse0))) (and (= .cse0 (select .cse1 (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select .cse2 dll_circular_create_~last~0.offset)) (not (= .cse0 |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (select .cse2 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|))))) [2018-11-23 11:12:22,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {1751#true} call ULTIMATE.init(); {1751#true} is VALID [2018-11-23 11:12:22,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1751#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1751#true} is VALID [2018-11-23 11:12:22,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {1751#true} assume true; {1751#true} is VALID [2018-11-23 11:12:22,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1751#true} {1751#true} #89#return; {1751#true} is VALID [2018-11-23 11:12:22,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1751#true} call #t~ret16 := main(); {1751#true} is VALID [2018-11-23 11:12:22,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1751#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1771#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:22,393 INFO L256 TraceCheckUtils]: 6: Hoare triple {1771#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1751#true} is VALID [2018-11-23 11:12:22,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {1751#true} ~len := #in~len;~data := #in~data; {1751#true} is VALID [2018-11-23 11:12:22,393 INFO L256 TraceCheckUtils]: 8: Hoare triple {1751#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1751#true} is VALID [2018-11-23 11:12:22,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1751#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:22,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:22,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {1784#(= (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~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:22,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:22,398 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1751#true} #85#return; {1798#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:12:22,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {1798#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~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; {1802#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:22,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {1802#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !!~bvsgt32(~len, 1bv32); {1802#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:22,401 INFO L256 TraceCheckUtils]: 16: Hoare triple {1802#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1809#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:12:22,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1813#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:22,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {1813#(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); {1813#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:22,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(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~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1820#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:22,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1820#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1820#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:22,409 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1820#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {1802#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} #87#return; {1827#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:22,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {1827#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.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); {1831#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:22,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {1831#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1835#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:12:22,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {1835#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~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; {1839#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:22,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {1839#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} assume !~bvsgt32(~len, 1bv32); {1839#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:22,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {1839#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1846#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:22,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {1846#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} assume true; {1846#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:22,430 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1846#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} {1771#(= |main_~#s~0.offset| (_ bv0 32))} #81#return; {1853#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:22,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {1853#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {1857#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| (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 ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:22,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {1857#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| (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 ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (bvadd v_subst_1 (_ bv4 32))))))} assume !!~bvslt32(~i~0, ~len~0); {1857#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| (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 ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:22,436 INFO L256 TraceCheckUtils]: 31: Hoare triple {1857#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| (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 ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (bvadd v_subst_1 (_ bv4 32))))))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1864#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:12:22,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {1864#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1868#(and (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) |dll_circular_remove_first_#t~mem8.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) dll_circular_remove_first_~temp~1.base))} is VALID [2018-11-23 11:12:22,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {1868#(and (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) |dll_circular_remove_first_#t~mem8.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) dll_circular_remove_first_~temp~1.base))} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} is VALID [2018-11-23 11:12:22,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} assume true; {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} is VALID [2018-11-23 11:12:22,448 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} {1857#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| (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 ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (bvadd v_subst_1 (_ bv4 32))))))} #83#return; {1752#false} is VALID [2018-11-23 11:12:22,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {1752#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1752#false} is VALID [2018-11-23 11:12:22,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {1752#false} assume !!~bvslt32(~i~0, ~len~0); {1752#false} is VALID [2018-11-23 11:12:22,449 INFO L256 TraceCheckUtils]: 38: Hoare triple {1752#false} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1752#false} is VALID [2018-11-23 11:12:22,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {1752#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1752#false} is VALID [2018-11-23 11:12:22,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {1752#false} assume !(~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~last~1.base, ~last~1.offset, ~temp~1.base, ~bvadd32(4bv32, ~temp~1.offset), 4bv32);call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~last~1.base, ~last~1.offset, 4bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem12.base, #t~mem12.offset);havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1752#false} is VALID [2018-11-23 11:12:22,449 INFO L273 TraceCheckUtils]: 41: Hoare triple {1752#false} assume true; {1752#false} is VALID [2018-11-23 11:12:22,450 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1752#false} {1752#false} #83#return; {1752#false} is VALID [2018-11-23 11:12:22,450 INFO L273 TraceCheckUtils]: 43: Hoare triple {1752#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1752#false} is VALID [2018-11-23 11:12:22,450 INFO L273 TraceCheckUtils]: 44: Hoare triple {1752#false} assume !~bvslt32(~i~0, ~len~0); {1752#false} is VALID [2018-11-23 11:12:22,450 INFO L273 TraceCheckUtils]: 45: Hoare triple {1752#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1752#false} is VALID [2018-11-23 11:12:22,450 INFO L273 TraceCheckUtils]: 46: Hoare triple {1752#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1752#false} is VALID [2018-11-23 11:12:22,451 INFO L273 TraceCheckUtils]: 47: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2018-11-23 11:12:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:12:22,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:23,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-23 11:12:23,067 INFO L478 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 16 [2018-11-23 11:12:23,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,085 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-23 11:12:23,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:25 [2018-11-23 11:12:23,096 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:23,097 WARN L384 uantifierElimination]: Input elimination task: ∀ [|main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) .cse0)) (not (= .cse1 |main_#t~ret13.offset|)) (not (= .cse0 |main_#t~ret13.base|)))) [2018-11-23 11:12:23,097 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|main_~#s~0.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| .cse0) |main_#t~ret13.offset|) .cse0)) (not (= .cse0 |main_#t~ret13.base|)))) [2018-11-23 11:12:24,004 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 11:12:24,212 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:12:24,317 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:12:26,403 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-23 11:12:26,445 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:26,446 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:298, output treesize:1 [2018-11-23 11:12:36,683 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 545 treesize of output 298 [2018-11-23 11:12:36,703 INFO L478 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 9 treesize of output 8 [2018-11-23 11:12:36,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:36,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 165 [2018-11-23 11:12:36,987 INFO L478 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 151 treesize of output 150 [2018-11-23 11:12:36,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:37,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-11-23 11:12:37,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-11-23 11:12:39,217 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-11-23 11:12:39,235 INFO L478 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 48 treesize of output 47 [2018-11-23 11:12:39,238 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:39,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 11:12:39,253 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:40,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-23 11:12:40,008 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:40,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-23 11:12:40,049 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:40,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2018-11-23 11:12:40,776 INFO L478 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 42 treesize of output 36 [2018-11-23 11:12:40,778 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,101 INFO L478 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 45 treesize of output 39 [2018-11-23 11:12:41,104 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2018-11-23 11:12:41,438 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,560 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-11-23 11:12:41,705 INFO L478 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 37 treesize of output 23 [2018-11-23 11:12:41,707 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,818 INFO L478 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 40 treesize of output 26 [2018-11-23 11:12:41,820 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,899 INFO L478 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 11 [2018-11-23 11:12:41,901 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,948 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2018-11-23 11:12:43,966 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 127 DAG size of output: 125 [2018-11-23 11:12:44,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2018-11-23 11:12:44,039 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:44,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2018-11-23 11:12:44,775 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:45,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2018-11-23 11:12:45,280 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:45,322 INFO L267 ElimStorePlain]: Start of recursive call 20: 10 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:45,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2018-11-23 11:12:46,028 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-11-23 11:12:46,052 INFO L478 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 0 case distinctions, treesize of input 31 treesize of output 11 [2018-11-23 11:12:46,054 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,066 INFO L478 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 29 treesize of output 15 [2018-11-23 11:12:46,068 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,228 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 14 [2018-11-23 11:12:46,231 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,362 INFO L478 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 14 treesize of output 8 [2018-11-23 11:12:46,385 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,571 INFO L267 ElimStorePlain]: Start of recursive call 24: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 11:12:46,611 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 1 [2018-11-23 11:12:46,614 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,633 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:46,748 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:12:47,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 147 treesize of output 126 [2018-11-23 11:12:53,689 WARN L180 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 316 DAG size of output: 236 [2018-11-23 11:12:53,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:53,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:53,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-11-23 11:12:53,745 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:53,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:53,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:53,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-11-23 11:12:53,767 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:58,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 11:12:58,327 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:58,342 INFO L478 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 70 treesize of output 69 [2018-11-23 11:12:58,347 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:02,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:02,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 51 [2018-11-23 11:13:02,364 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:02,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:02,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-23 11:13:02,424 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:06,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:06,428 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:06,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:06,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:06,577 INFO L303 Elim1Store]: Index analysis took 206 ms [2018-11-23 11:13:06,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 106 [2018-11-23 11:13:06,802 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:06,823 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-23 11:13:06,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 126 [2018-11-23 11:13:06,900 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:07,656 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:07,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:07,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 108 [2018-11-23 11:13:07,819 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:08,600 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-11-23 11:13:08,633 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,640 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,683 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 11:13:08,722 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:13:08,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:08,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 11:13:08,832 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:08,861 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:08,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2018-11-23 11:13:08,919 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 1 [2018-11-23 11:13:08,926 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:09,035 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:09,035 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:09,062 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:09,080 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:09,082 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2018-11-23 11:13:09,085 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:09,116 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:09,726 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:09,837 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-23 11:13:10,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 72 [2018-11-23 11:13:10,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2018-11-23 11:13:10,109 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:10,368 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,474 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,475 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-23 11:13:10,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-11-23 11:13:10,478 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:10,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,857 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,873 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:10,874 INFO L303 Elim1Store]: Index analysis took 160 ms [2018-11-23 11:13:10,875 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-11-23 11:13:10,877 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:10,940 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:13:11,076 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:11,097 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,105 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,106 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:11,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:11,216 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 11:13:11,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 88 [2018-11-23 11:13:11,281 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 93 [2018-11-23 11:13:11,378 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:11,646 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,652 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:11,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2018-11-23 11:13:11,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2018-11-23 11:13:11,771 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:11,945 INFO L478 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 0 case distinctions, treesize of input 65 treesize of output 45 [2018-11-23 11:13:11,947 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:12,059 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,477 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,485 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,486 INFO L303 Elim1Store]: Index analysis took 432 ms [2018-11-23 11:13:12,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 11:13:12,488 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:12,581 INFO L478 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 18 [2018-11-23 11:13:12,583 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:12,697 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,697 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,705 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-11-23 11:13:12,708 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:12,740 INFO L267 ElimStorePlain]: Start of recursive call 53: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:12,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2018-11-23 11:13:12,935 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,942 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:12,972 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 83 [2018-11-23 11:13:12,982 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:13:13,245 INFO L478 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 49 treesize of output 39 [2018-11-23 11:13:13,254 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:13,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:13,389 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:13,390 INFO L478 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 60 treesize of output 54 [2018-11-23 11:13:13,395 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:13,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:13,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2018-11-23 11:13:13,548 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:13,606 INFO L267 ElimStorePlain]: Start of recursive call 59: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:13,635 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:16,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:16,851 INFO L303 Elim1Store]: Index analysis took 224 ms [2018-11-23 11:13:17,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 98 [2018-11-23 11:13:17,225 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:17,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 83 [2018-11-23 11:13:17,240 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:19,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:19,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:19,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 74 [2018-11-23 11:13:19,851 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:21,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:21,890 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-23 11:13:21,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 104 [2018-11-23 11:13:21,985 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:24,794 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:24,818 INFO L303 Elim1Store]: Index analysis took 202 ms [2018-11-23 11:13:25,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 113 [2018-11-23 11:13:25,109 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:27,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:27,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 69 [2018-11-23 11:13:28,909 WARN L180 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-11-23 11:13:28,962 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,072 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,101 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,122 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,123 INFO L303 Elim1Store]: Index analysis took 170 ms [2018-11-23 11:13:29,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-11-23 11:13:29,125 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:29,485 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:29,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 40 [2018-11-23 11:13:29,580 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:29,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2018-11-23 11:13:29,847 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:30,084 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:30,153 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-11-23 11:13:30,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 11:13:30,191 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:30,282 INFO L267 ElimStorePlain]: Start of recursive call 69: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:13:32,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-11-23 11:13:32,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2018-11-23 11:13:32,896 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:33,016 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:33,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 11:13:33,090 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:33,165 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:33,442 INFO L267 ElimStorePlain]: Start of recursive call 64: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:33,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:33,581 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-11-23 11:13:33,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 73 [2018-11-23 11:13:33,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:33,854 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-23 11:13:34,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 115 [2018-11-23 11:13:34,107 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 4 xjuncts. [2018-11-23 11:13:34,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:34,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 99 [2018-11-23 11:13:34,990 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:35,821 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:35,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:35,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-11-23 11:13:35,843 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:36,624 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:36,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 74 [2018-11-23 11:13:36,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:36,882 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:36,959 INFO L303 Elim1Store]: Index analysis took 213 ms [2018-11-23 11:13:37,172 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 77 [2018-11-23 11:13:37,270 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:13:37,592 INFO L478 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 46 treesize of output 38 [2018-11-23 11:13:37,593 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:37,757 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:37,758 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:37,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-11-23 11:13:37,763 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:37,928 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:37,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-23 11:13:37,932 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,019 INFO L478 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 35 treesize of output 24 [2018-11-23 11:13:38,022 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,059 INFO L267 ElimStorePlain]: Start of recursive call 81: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 73 [2018-11-23 11:13:38,225 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,226 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,235 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-11-23 11:13:38,238 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2018-11-23 11:13:38,421 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,553 INFO L478 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 21 [2018-11-23 11:13:38,554 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,731 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,738 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:38,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2018-11-23 11:13:38,744 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2018-11-23 11:13:38,890 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:38,923 INFO L267 ElimStorePlain]: Start of recursive call 87: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:39,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-11-23 11:13:39,353 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:39,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 34 [2018-11-23 11:13:39,417 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-11-23 11:13:39,480 INFO L478 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 19 treesize of output 9 [2018-11-23 11:13:39,481 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:39,489 INFO L478 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 13 [2018-11-23 11:13:39,490 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:39,536 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:13:39,616 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:39,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 11:13:39,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:39,656 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 4 [2018-11-23 11:13:39,658 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:39,680 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:42,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:42,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 86 [2018-11-23 11:13:42,357 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:42,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-11-23 11:13:42,361 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:43,479 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:43,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2018-11-23 11:13:43,483 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:44,697 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:44,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2018-11-23 11:13:44,702 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:45,800 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:45,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2018-11-23 11:13:45,805 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:46,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2018-11-23 11:13:46,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:46,937 INFO L478 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 0 case distinctions, treesize of input 35 treesize of output 15 [2018-11-23 11:13:46,939 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:47,118 INFO L478 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 32 [2018-11-23 11:13:47,121 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:47,540 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:47,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:47,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 17 [2018-11-23 11:13:47,552 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:47,601 INFO L267 ElimStorePlain]: Start of recursive call 104: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:48,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:13:48,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:48,343 INFO L478 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 0 case distinctions, treesize of input 36 treesize of output 16 [2018-11-23 11:13:48,346 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:48,445 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:48,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:48,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2018-11-23 11:13:48,468 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:48,494 INFO L267 ElimStorePlain]: Start of recursive call 108: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:48,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:49,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2018-11-23 11:13:49,149 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:49,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:49,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2018-11-23 11:13:49,174 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:49,367 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:49,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:49,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 14 [2018-11-23 11:13:49,397 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:49,439 INFO L267 ElimStorePlain]: Start of recursive call 111: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:49,538 INFO L267 ElimStorePlain]: Start of recursive call 99: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:49,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:49,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 71 [2018-11-23 11:13:49,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:49,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-11-23 11:13:49,720 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:50,302 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:50,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2018-11-23 11:13:50,323 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:50,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-23 11:13:50,568 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:50,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2018-11-23 11:13:50,580 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:50,612 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:50,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2018-11-23 11:13:50,858 INFO L478 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 46 treesize of output 38 [2018-11-23 11:13:50,861 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:50,995 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:50,996 INFO L478 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 38 treesize of output 29 [2018-11-23 11:13:50,998 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:51,101 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:13:51,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:13:51,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2018-11-23 11:13:51,115 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:51,154 INFO L267 ElimStorePlain]: Start of recursive call 119: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:51,222 INFO L267 ElimStorePlain]: Start of recursive call 114: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:13:51,433 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:13:51,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:13:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:13:51,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:13:51,733 INFO L202 ElimStorePlain]: Needed 122 recursive calls to eliminate 5 variables, input treesize:545, output treesize:18 [2018-11-23 11:13:51,780 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:51,781 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, dll_circular_create_~head~0.offset, dll_circular_create_~last~0.offset, |main_~#s~0.base|, |v_main_~#s~0.offset_BEFORE_CALL_8|]. (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| |dll_circular_create_#t~ret4.base| (store (select |#memory_$Pointer$.base| |dll_circular_create_#t~ret4.base|) |dll_circular_create_#t~ret4.offset| dll_circular_create_~head~0.base)))) (store .cse4 dll_circular_create_~head~0.base (store (select .cse4 dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) |dll_circular_create_#t~ret4.base|))))) (store .cse3 dll_circular_create_~last~0.base (store (select .cse3 dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset |dll_circular_create_#t~ret4.base|))))) (store .cse2 |dll_circular_create_#t~ret4.base| (store (select .cse2 |dll_circular_create_#t~ret4.base|) (bvadd |dll_circular_create_#t~ret4.offset| (_ bv4 32)) dll_circular_create_~last~0.base))))) (let ((.cse0 (select (select .cse1 |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (or (not (= |dll_circular_create_#t~ret4.base| .cse0)) (not (= .cse0 (select (select .cse1 .cse0) |dll_circular_create_#t~ret4.offset|)))))) [2018-11-23 11:13:51,781 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))) (and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (or (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) .cse0) .cse0)) [2018-11-23 11:13:52,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2018-11-23 11:13:52,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {1752#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1752#false} is VALID [2018-11-23 11:13:52,632 INFO L273 TraceCheckUtils]: 45: Hoare triple {1752#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1752#false} is VALID [2018-11-23 11:13:52,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {1752#false} assume !~bvslt32(~i~0, ~len~0); {1752#false} is VALID [2018-11-23 11:13:52,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {1752#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1752#false} is VALID [2018-11-23 11:13:52,633 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1751#true} {1752#false} #83#return; {1752#false} is VALID [2018-11-23 11:13:52,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {1751#true} assume true; {1751#true} is VALID [2018-11-23 11:13:52,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {1751#true} assume !(~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~last~1.base, ~last~1.offset, ~temp~1.base, ~bvadd32(4bv32, ~temp~1.offset), 4bv32);call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~last~1.base, ~last~1.offset, 4bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem12.base, #t~mem12.offset);havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1751#true} is VALID [2018-11-23 11:13:52,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {1751#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1751#true} is VALID [2018-11-23 11:13:52,634 INFO L256 TraceCheckUtils]: 38: Hoare triple {1752#false} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1751#true} is VALID [2018-11-23 11:13:52,634 INFO L273 TraceCheckUtils]: 37: Hoare triple {1752#false} assume !!~bvslt32(~i~0, ~len~0); {1752#false} is VALID [2018-11-23 11:13:52,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {1752#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1752#false} is VALID [2018-11-23 11:13:52,643 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} {1951#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #83#return; {1752#false} is VALID [2018-11-23 11:13:52,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} assume true; {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} is VALID [2018-11-23 11:13:52,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {1961#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (not (= dll_circular_remove_first_~temp~1.base |dll_circular_remove_first_#t~mem8.base|)))} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1872#(= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))} is VALID [2018-11-23 11:13:52,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {1965#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset, 4bv32);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1961#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (not (= dll_circular_remove_first_~temp~1.base |dll_circular_remove_first_#t~mem8.base|)))} is VALID [2018-11-23 11:13:52,647 INFO L256 TraceCheckUtils]: 31: Hoare triple {1951#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1965#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|))))} is VALID [2018-11-23 11:13:52,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {1951#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !!~bvslt32(~i~0, ~len~0); {1951#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:13:52,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {1972#(forall ((|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret13.base|))))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32; {1951#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:13:52,651 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1979#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|) |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} {1751#true} #81#return; {1972#(forall ((|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret13.base|))))} is VALID [2018-11-23 11:13:52,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {1979#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|) |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} assume true; {1979#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|) |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is VALID [2018-11-23 11:13:53,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {1986#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1979#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|) |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is VALID [2018-11-23 11:13:53,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {1986#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} assume !~bvsgt32(~len, 1bv32); {1986#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is VALID [2018-11-23 11:13:55,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {1993#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= dll_circular_create_~new_head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~new_head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} ~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; {1986#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is UNKNOWN [2018-11-23 11:13:57,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {1997#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~new_head~0.offset) (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~new_head~0.base (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1993#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= dll_circular_create_~new_head~0.base (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~new_head~0.offset) (select (select (store (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is UNKNOWN [2018-11-23 11:13:57,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {2001#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (not (= dll_circular_create_~last~0.base |dll_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); {1997#(forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)) dll_circular_create_~new_head~0.offset) (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|))) (not (= dll_circular_create_~new_head~0.base (select (select (store (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base (store (select (store (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base (store (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) (bvadd dll_circular_create_~new_head~0.offset (_ bv4 32)) dll_circular_create_~last~0.base)) |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8|)))))} is VALID [2018-11-23 11:13:57,606 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2009#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} {2005#(and (not (= (_ bv0 1) (select |#valid| dll_circular_create_~last~0.base))) (not (= (select |#valid| dll_circular_create_~head~0.base) (_ bv0 1))))} #87#return; {2001#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:13:57,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {2009#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} assume true; {2009#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-23 11:13:57,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {2016#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2009#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-23 11:13:57,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {2016#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2016#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-23 11:13:57,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {2023#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (= (_ bv0 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|))))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2016#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-23 11:13:57,612 INFO L256 TraceCheckUtils]: 16: Hoare triple {2005#(and (not (= (_ bv0 1) (select |#valid| dll_circular_create_~last~0.base))) (not (= (select |#valid| dll_circular_create_~head~0.base) (_ bv0 1))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2023#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (= (_ bv0 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|))))} is VALID [2018-11-23 11:13:57,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {2005#(and (not (= (_ bv0 1) (select |#valid| dll_circular_create_~last~0.base))) (not (= (select |#valid| dll_circular_create_~head~0.base) (_ bv0 1))))} assume !!~bvsgt32(~len, 1bv32); {2005#(and (not (= (_ bv0 1) (select |#valid| dll_circular_create_~last~0.base))) (not (= (select |#valid| dll_circular_create_~head~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:13:57,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {1798#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~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; {2005#(and (not (= (_ bv0 1) (select |#valid| dll_circular_create_~last~0.base))) (not (= (select |#valid| dll_circular_create_~head~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:13:57,615 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1751#true} #85#return; {1798#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:13:57,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:13:57,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1784#(= (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~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1791#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:13:57,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:13:57,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {1751#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1784#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:13:57,619 INFO L256 TraceCheckUtils]: 8: Hoare triple {1751#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1751#true} is VALID [2018-11-23 11:13:57,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {1751#true} ~len := #in~len;~data := #in~data; {1751#true} is VALID [2018-11-23 11:13:57,620 INFO L256 TraceCheckUtils]: 6: Hoare triple {1751#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1751#true} is VALID [2018-11-23 11:13:57,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {1751#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1751#true} is VALID [2018-11-23 11:13:57,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {1751#true} call #t~ret16 := main(); {1751#true} is VALID [2018-11-23 11:13:57,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1751#true} {1751#true} #89#return; {1751#true} is VALID [2018-11-23 11:13:57,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {1751#true} assume true; {1751#true} is VALID [2018-11-23 11:13:57,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {1751#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1751#true} is VALID [2018-11-23 11:13:57,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {1751#true} call ULTIMATE.init(); {1751#true} is VALID [2018-11-23 11:13:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:13:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:13:57,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2018-11-23 11:13:57,650 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-11-23 11:13:57,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:13:57,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:14:01,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 74 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:01,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:14:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:14:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=966, Unknown=9, NotChecked=0, Total=1056 [2018-11-23 11:14:01,221 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 33 states. [2018-11-23 11:14:18,001 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:14:25,934 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 11:14:39,681 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:15:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:20,630 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-23 11:15:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:15:20,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-11-23 11:15:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:15:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 89 transitions. [2018-11-23 11:15:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:15:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 89 transitions. [2018-11-23 11:15:20,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 89 transitions. [2018-11-23 11:15:22,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:22,923 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:15:22,923 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:15:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=217, Invalid=2340, Unknown=95, NotChecked=0, Total=2652 [2018-11-23 11:15:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:15:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-11-23 11:15:23,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:23,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 53 states. [2018-11-23 11:15:23,173 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 53 states. [2018-11-23 11:15:23,174 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 53 states. [2018-11-23 11:15:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:23,178 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-23 11:15:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-11-23 11:15:23,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:23,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:23,179 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 63 states. [2018-11-23 11:15:23,180 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 63 states. [2018-11-23 11:15:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:23,183 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-23 11:15:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-11-23 11:15:23,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:23,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:23,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:23,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:15:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-23 11:15:23,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 48 [2018-11-23 11:15:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:23,188 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-23 11:15:23,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:15:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-23 11:15:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:15:23,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:23,189 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:15:23,189 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:23,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1545890147, now seen corresponding path program 1 times [2018-11-23 11:15:23,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:23,190 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-23 11:15:23,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:23,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:23,515 INFO L478 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-23 11:15:23,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:15:23,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:23,527 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_104|]. (and (= |#valid| (store |v_#valid_104| |main_~#s~0.base| (_ bv1 1))) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:15:23,528 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:15:23,837 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:15:24,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:24,226 INFO L478 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-23 11:15:24,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:24,293 INFO L478 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-23 11:15:24,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-11-23 11:15:24,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:24,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 11:15:24,479 INFO L478 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-23 11:15:24,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:24,561 INFO L478 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 30 treesize of output 31 [2018-11-23 11:15:24,569 INFO L478 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-23 11:15:24,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2018-11-23 11:15:24,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:24,977 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-23 11:15:24,978 INFO L478 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 64 treesize of output 46 [2018-11-23 11:15:24,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-23 11:15:24,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,095 INFO L478 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 43 treesize of output 46 [2018-11-23 11:15:25,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:15:25,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-11-23 11:15:25,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 11:15:25,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 92 [2018-11-23 11:15:25,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,455 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 130 [2018-11-23 11:15:25,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:15:25,542 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,590 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:25,635 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:148, output treesize:98 [2018-11-23 11:15:25,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 11:15:25,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:100 [2018-11-23 11:15:26,016 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:26,016 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_48|]. (let ((.cse5 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse1 (select .cse5 |main_#t~ret13.offset|))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse1)) (.cse2 (select |#memory_$Pointer$.offset| |main_#t~ret13.base|)) (.cse3 (select |#memory_$Pointer$.base| .cse1)) (.cse4 (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (and (= |main_#t~ret13.offset| (select .cse0 |main_#t~ret13.offset|)) (= (select (store |v_old(#valid)_AFTER_CALL_48| .cse1 (_ bv1 1)) |main_#t~ret13.base|) (_ bv0 1)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse1) (_ bv0 1)) (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_48| |main_~#s~0.base|)) (= (_ bv0 32) (select .cse2 (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select .cse0 (_ bv4 32)) |main_#t~ret13.offset|) (= (select .cse3 (_ bv4 32)) |main_#t~ret13.base|) (= (select .cse2 .cse4) (_ bv0 32)) (= |main_#t~ret13.base| (select .cse3 (_ bv0 32))) (= .cse1 (select .cse5 .cse4)) (= |main_#t~ret13.offset| (_ bv0 32)))))) [2018-11-23 11:15:26,016 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse2 (select .cse5 |main_#t~ret13.offset|))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse2)) (.cse1 (select |#memory_$Pointer$.offset| |main_#t~ret13.base|)) (.cse4 (select |#memory_$Pointer$.base| .cse2)) (.cse3 (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (and (= |main_#t~ret13.offset| (select .cse0 |main_#t~ret13.offset|)) (= (_ bv0 32) (select .cse1 (_ bv0 32))) (= (select .cse0 (_ bv4 32)) |main_#t~ret13.offset|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= .cse2 |main_#t~ret13.base|)) (= (select .cse1 .cse3) (_ bv0 32)) (= |main_#t~ret13.base| (select .cse4 (_ bv0 32))) (= (select .cse4 (_ bv4 32)) |main_#t~ret13.base|) (not (= .cse2 |main_~#s~0.base|)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= .cse2 (select .cse5 .cse3)) (= |main_#t~ret13.offset| (_ bv0 32)))))) [2018-11-23 11:15:26,456 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-23 11:15:30,103 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:15:30,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:30,300 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:30,409 INFO L303 Elim1Store]: Index analysis took 250 ms [2018-11-23 11:15:30,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 971 treesize of output 797 [2018-11-23 11:15:30,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:30,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:30,497 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:30,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 157 [2018-11-23 11:15:30,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:31,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:31,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:31,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:31,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:32,030 INFO L303 Elim1Store]: Index analysis took 466 ms [2018-11-23 11:15:32,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 783 treesize of output 755 [2018-11-23 11:15:32,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 142 [2018-11-23 11:15:32,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:32,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,476 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:32,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 661 treesize of output 594 [2018-11-23 11:15:32,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 584 treesize of output 497 [2018-11-23 11:15:32,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:32,778 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 497 treesize of output 358 [2018-11-23 11:15:33,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:33,896 INFO L303 Elim1Store]: Index analysis took 142 ms [2018-11-23 11:15:33,939 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 177 [2018-11-23 11:15:33,953 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:34,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 318 [2018-11-23 11:15:34,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,495 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 215 [2018-11-23 11:15:34,530 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:34,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 214 [2018-11-23 11:15:34,926 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 244 treesize of output 235 [2018-11-23 11:15:35,186 INFO L267 ElimStorePlain]: Start of recursive call 13: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts. [2018-11-23 11:15:39,164 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts. [2018-11-23 11:15:42,638 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts.