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-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:10:05,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:10:05,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:10:05,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:10:05,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:10:05,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:10:05,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:10:05,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:10:05,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:10:05,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:10:05,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:10:05,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:10:05,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:10:05,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:10:05,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:10:05,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:10:05,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:10:05,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:10:05,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:10:05,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:10:05,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:10:05,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:10:05,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:10:05,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:10:05,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:10:05,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:10:05,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:10:05,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:10:05,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:10:05,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:10:05,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:10:05,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:10:05,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:10:05,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:10:05,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:10:05,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:10:05,628 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:10:05,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:10:05,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:10:05,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:10:05,656 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:10:05,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:10:05,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:10:05,660 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:10:05,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:10:05,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:10:05,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:10:05,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:10:05,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:10:05,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:10:05,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:10:05,663 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:10:05,663 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:10:05,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:10:05,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:10:05,663 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:10:05,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:10:05,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:10:05,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:10:05,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:10:05,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:10:05,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:10:05,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:10:05,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:10:05,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:10:05,666 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:10:05,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:10:05,667 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:10:05,667 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:10:05,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:10:05,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:10:05,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:10:05,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:10:05,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:10:05,744 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:10:05,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 11:10:05,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5884ff1/3efdc5e36afa43e68d510ab62b3a1558/FLAG6ca551c2a [2018-11-23 11:10:06,318 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:10:06,319 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 11:10:06,338 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5884ff1/3efdc5e36afa43e68d510ab62b3a1558/FLAG6ca551c2a [2018-11-23 11:10:06,612 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5884ff1/3efdc5e36afa43e68d510ab62b3a1558 [2018-11-23 11:10:06,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:10:06,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:10:06,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:06,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:10:06,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:10:06,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:06" (1/1) ... [2018-11-23 11:10:06,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29be5391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:06, skipping insertion in model container [2018-11-23 11:10:06,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:06" (1/1) ... [2018-11-23 11:10:06,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:10:06,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:10:07,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:07,155 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:10:07,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:07,392 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:10:07,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07 WrapperNode [2018-11-23 11:10:07,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:07,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:07,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:10:07,394 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:10:07,405 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:10:07" (1/1) ... [2018-11-23 11:10:07,427 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:10:07" (1/1) ... [2018-11-23 11:10:07,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:07,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:10:07,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:10:07,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:10:07,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (1/1) ... [2018-11-23 11:10:07,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:10:07,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:10:07,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:10:07,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:10:07,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (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:10:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:10:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:10:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:10:07,580 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:10:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:10:07,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:10:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:10:07,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:10:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:10:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:10:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:10:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:10:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:10:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:10:09,416 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:10:09,417 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:10:09,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:09 BoogieIcfgContainer [2018-11-23 11:10:09,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:10:09,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:10:09,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:10:09,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:10:09,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:10:06" (1/3) ... [2018-11-23 11:10:09,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194033bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:09, skipping insertion in model container [2018-11-23 11:10:09,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:07" (2/3) ... [2018-11-23 11:10:09,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194033bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:09, skipping insertion in model container [2018-11-23 11:10:09,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:09" (3/3) ... [2018-11-23 11:10:09,426 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_true-unreach-call_false-termination.i [2018-11-23 11:10:09,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:10:09,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:10:09,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:10:09,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:10:09,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:10:09,496 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:10:09,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:10:09,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:10:09,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:10:09,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:10:09,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:10:09,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:10:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-23 11:10:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:10:09,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:09,525 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] [2018-11-23 11:10:09,528 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:09,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -48326112, now seen corresponding path program 1 times [2018-11-23 11:10:09,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:09,540 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:10:09,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:09,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:09,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {55#true} is VALID [2018-11-23 11:10:09,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {55#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {55#true} is VALID [2018-11-23 11:10:09,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 11:10:09,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55#true} {55#true} #200#return; {55#true} is VALID [2018-11-23 11:10:09,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {55#true} call #t~ret39 := main(); {55#true} is VALID [2018-11-23 11:10:09,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {55#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {55#true} is VALID [2018-11-23 11:10:09,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {55#true} is VALID [2018-11-23 11:10:09,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {55#true} is VALID [2018-11-23 11:10:09,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {55#true} is VALID [2018-11-23 11:10:09,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {55#true} is VALID [2018-11-23 11:10:09,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {55#true} is VALID [2018-11-23 11:10:09,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {55#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {55#true} is VALID [2018-11-23 11:10:09,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#true} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {55#true} is VALID [2018-11-23 11:10:09,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {55#true} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {55#true} is VALID [2018-11-23 11:10:09,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#true} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {55#true} is VALID [2018-11-23 11:10:09,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#true} assume !true; {56#false} is VALID [2018-11-23 11:10:09,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {56#false} assume !true; {56#false} is VALID [2018-11-23 11:10:09,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {56#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {56#false} is VALID [2018-11-23 11:10:09,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {56#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {56#false} is VALID [2018-11-23 11:10:09,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {56#false} assume !false; {56#false} is VALID [2018-11-23 11:10:09,767 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:10:09,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:10:09,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:09,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:10:09,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 11:10:09,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:09,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:10:09,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:10:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:10:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:09,877 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-11-23 11:10:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:10,813 INFO L93 Difference]: Finished difference Result 98 states and 152 transitions. [2018-11-23 11:10:10,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:10:10,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 11:10:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2018-11-23 11:10:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2018-11-23 11:10:10,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 152 transitions. [2018-11-23 11:10:11,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:11,209 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:10:11,209 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:10:11,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:10:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:10:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:10:11,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:11,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:10:11,260 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:10:11,260 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:10:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:11,265 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2018-11-23 11:10:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2018-11-23 11:10:11,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:11,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:11,267 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:10:11,267 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:10:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:11,272 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2018-11-23 11:10:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2018-11-23 11:10:11,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:11,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:11,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:11,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:10:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2018-11-23 11:10:11,280 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 20 [2018-11-23 11:10:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:11,280 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2018-11-23 11:10:11,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:10:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2018-11-23 11:10:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:10:11,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:11,282 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] [2018-11-23 11:10:11,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:11,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1580956794, now seen corresponding path program 1 times [2018-11-23 11:10:11,284 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:11,284 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:10:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:11,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:11,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2018-11-23 11:10:11,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {376#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {376#true} is VALID [2018-11-23 11:10:11,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-23 11:10:11,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #200#return; {376#true} is VALID [2018-11-23 11:10:11,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret39 := main(); {376#true} is VALID [2018-11-23 11:10:11,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {376#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {396#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-23 11:10:11,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {396#(not (= main_~root~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {396#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-23 11:10:11,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(not (= main_~root~0.base (_ bv0 32)))} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {396#(not (= main_~root~0.base (_ bv0 32)))} is VALID [2018-11-23 11:10:11,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {396#(not (= main_~root~0.base (_ bv0 32)))} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {377#false} is VALID [2018-11-23 11:10:11,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {377#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {377#false} is VALID [2018-11-23 11:10:11,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {377#false} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {377#false} is VALID [2018-11-23 11:10:11,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {377#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {377#false} is VALID [2018-11-23 11:10:11,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {377#false} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {377#false} is VALID [2018-11-23 11:10:11,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {377#false} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {377#false} is VALID [2018-11-23 11:10:11,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {377#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {377#false} is VALID [2018-11-23 11:10:11,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {377#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {377#false} is VALID [2018-11-23 11:10:11,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {377#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {377#false} is VALID [2018-11-23 11:10:11,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {377#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {377#false} is VALID [2018-11-23 11:10:11,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {377#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {377#false} is VALID [2018-11-23 11:10:11,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {377#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {377#false} is VALID [2018-11-23 11:10:11,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {377#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {377#false} is VALID [2018-11-23 11:10:11,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {377#false} assume !false; {377#false} is VALID [2018-11-23 11:10:11,476 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:10:11,476 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:10:11,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:11,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:10:11,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:10:11,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:11,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:10:11,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:11,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:10:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:10:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:10:11,576 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 3 states. [2018-11-23 11:10:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:12,192 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2018-11-23 11:10:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:10:12,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:10:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:10:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 11:10:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:10:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 11:10:12,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-23 11:10:12,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:12,485 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:10:12,485 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:10:12,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:10:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:10:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 11:10:12,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:12,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 11:10:12,513 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:10:12,513 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:10:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:12,517 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-11-23 11:10:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2018-11-23 11:10:12,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:12,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:12,518 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:10:12,519 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:10:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:12,522 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-11-23 11:10:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2018-11-23 11:10:12,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:12,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:12,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:12,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:10:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2018-11-23 11:10:12,527 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 22 [2018-11-23 11:10:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:12,528 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2018-11-23 11:10:12,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:10:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2018-11-23 11:10:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:10:12,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:12,530 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, 1, 1, 1, 1] [2018-11-23 11:10:12,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1938767375, now seen corresponding path program 1 times [2018-11-23 11:10:12,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:12,531 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:10:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:12,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:12,771 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:10:12,786 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:10:12,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:10:12,882 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 17 treesize of output 13 [2018-11-23 11:10:12,895 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 13 treesize of output 5 [2018-11-23 11:10:12,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:12,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:12,939 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:12,940 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_#t~mem38| .cse0))) [2018-11-23 11:10:12,940 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32)) [2018-11-23 11:10:12,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2018-11-23 11:10:12,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {688#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {688#true} is VALID [2018-11-23 11:10:12,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {688#true} assume true; {688#true} is VALID [2018-11-23 11:10:12,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {688#true} {688#true} #200#return; {688#true} is VALID [2018-11-23 11:10:12,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {688#true} call #t~ret39 := main(); {688#true} is VALID [2018-11-23 11:10:12,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {688#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {688#true} is VALID [2018-11-23 11:10:12,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {688#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {688#true} is VALID [2018-11-23 11:10:12,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {688#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {688#true} is VALID [2018-11-23 11:10:12,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {688#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {688#true} is VALID [2018-11-23 11:10:12,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {688#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {688#true} is VALID [2018-11-23 11:10:12,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {688#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {688#true} is VALID [2018-11-23 11:10:12,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {688#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {688#true} is VALID [2018-11-23 11:10:12,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {688#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {688#true} is VALID [2018-11-23 11:10:12,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {688#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {688#true} is VALID [2018-11-23 11:10:12,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {688#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {688#true} is VALID [2018-11-23 11:10:12,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {688#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {738#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:12,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {738#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {738#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:12,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {738#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:12,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:12,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:13,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {745#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:13,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:13,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:13,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:13,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:13,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {755#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {771#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:13,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {771#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume 3bv32 != #t~mem38;havoc #t~mem38; {689#false} is VALID [2018-11-23 11:10:13,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {689#false} assume !false; {689#false} is VALID [2018-11-23 11:10:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:13,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:13,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:13,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:10:13,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:10:13,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:13,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:13,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:13,065 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand 6 states. [2018-11-23 11:10:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:14,758 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-23 11:10:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:14,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:10:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-23 11:10:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-23 11:10:14,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2018-11-23 11:10:15,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:15,032 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:10:15,032 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:10:15,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:10:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-11-23 11:10:15,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:15,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 57 states. [2018-11-23 11:10:15,075 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 57 states. [2018-11-23 11:10:15,075 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 57 states. [2018-11-23 11:10:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:15,078 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2018-11-23 11:10:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-11-23 11:10:15,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:15,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:15,080 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 69 states. [2018-11-23 11:10:15,080 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 69 states. [2018-11-23 11:10:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:15,084 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2018-11-23 11:10:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-11-23 11:10:15,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:15,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:15,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:15,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:10:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-11-23 11:10:15,089 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 28 [2018-11-23 11:10:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:15,090 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2018-11-23 11:10:15,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2018-11-23 11:10:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:10:15,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:15,091 INFO L402 BasicCegarLoop]: trace histogram [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:10:15,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:15,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 909038860, now seen corresponding path program 1 times [2018-11-23 11:10:15,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:15,093 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:10:15,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:15,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:15,351 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:10:15,355 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:10:15,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:10:15,459 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 17 treesize of output 13 [2018-11-23 11:10:15,520 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 13 treesize of output 5 [2018-11-23 11:10:15,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:15,583 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:15,583 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_#t~mem36| .cse0))) [2018-11-23 11:10:15,583 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem36| (_ bv4294967293 32))) [2018-11-23 11:10:15,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {1078#true} call ULTIMATE.init(); {1078#true} is VALID [2018-11-23 11:10:15,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {1078#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1078#true} is VALID [2018-11-23 11:10:15,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-23 11:10:15,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1078#true} {1078#true} #200#return; {1078#true} is VALID [2018-11-23 11:10:15,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {1078#true} call #t~ret39 := main(); {1078#true} is VALID [2018-11-23 11:10:15,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {1078#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1078#true} is VALID [2018-11-23 11:10:15,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {1078#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1078#true} is VALID [2018-11-23 11:10:15,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1078#true} is VALID [2018-11-23 11:10:15,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {1078#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1078#true} is VALID [2018-11-23 11:10:15,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1078#true} is VALID [2018-11-23 11:10:15,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1078#true} is VALID [2018-11-23 11:10:15,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {1078#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {1078#true} is VALID [2018-11-23 11:10:15,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1078#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1078#true} is VALID [2018-11-23 11:10:15,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {1078#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1078#true} is VALID [2018-11-23 11:10:15,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {1078#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1078#true} is VALID [2018-11-23 11:10:15,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {1078#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1128#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:15,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {1128#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1128#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:15,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {1128#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:15,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:15,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:15,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1135#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {1145#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1155#(= (_ bv3 32) |main_#t~mem36|)} is VALID [2018-11-23 11:10:15,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {1155#(= (_ bv3 32) |main_#t~mem36|)} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {1079#false} is VALID [2018-11-23 11:10:15,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {1079#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1079#false} is VALID [2018-11-23 11:10:15,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {1079#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {1079#false} is VALID [2018-11-23 11:10:15,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {1079#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1079#false} is VALID [2018-11-23 11:10:15,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {1079#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {1079#false} is VALID [2018-11-23 11:10:15,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {1079#false} assume !false; {1079#false} is VALID [2018-11-23 11:10:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:15,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:15,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:10:15,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:10:15,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:15,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:15,671 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:10:15,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:15,673 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 6 states. [2018-11-23 11:10:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:17,413 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-11-23 11:10:17,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:17,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:10:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:10:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:10:17,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-23 11:10:17,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:17,585 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:10:17,586 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:10:17,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:10:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-11-23 11:10:17,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:17,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 55 states. [2018-11-23 11:10:17,671 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 55 states. [2018-11-23 11:10:17,671 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 55 states. [2018-11-23 11:10:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:17,674 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:10:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:10:17,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:17,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:17,675 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 67 states. [2018-11-23 11:10:17,675 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 67 states. [2018-11-23 11:10:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:17,679 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:10:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:10:17,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:17,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:17,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:17,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:10:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2018-11-23 11:10:17,682 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 30 [2018-11-23 11:10:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:17,683 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2018-11-23 11:10:17,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 11:10:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:10:17,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:17,684 INFO L402 BasicCegarLoop]: trace histogram [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:10:17,684 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:17,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1933741836, now seen corresponding path program 1 times [2018-11-23 11:10:17,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:17,685 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:10:17,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:17,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:17,868 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:10:17,876 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:10:17,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:10:17,920 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 17 treesize of output 13 [2018-11-23 11:10:17,925 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 13 treesize of output 5 [2018-11-23 11:10:17,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:17,936 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:17,936 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_#t~mem34| .cse0))) [2018-11-23 11:10:17,936 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32)) [2018-11-23 11:10:17,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {1470#true} call ULTIMATE.init(); {1470#true} is VALID [2018-11-23 11:10:17,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {1470#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1470#true} is VALID [2018-11-23 11:10:17,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {1470#true} assume true; {1470#true} is VALID [2018-11-23 11:10:17,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1470#true} {1470#true} #200#return; {1470#true} is VALID [2018-11-23 11:10:17,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {1470#true} call #t~ret39 := main(); {1470#true} is VALID [2018-11-23 11:10:17,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {1470#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1470#true} is VALID [2018-11-23 11:10:17,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {1470#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1470#true} is VALID [2018-11-23 11:10:17,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {1470#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1470#true} is VALID [2018-11-23 11:10:17,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {1470#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1470#true} is VALID [2018-11-23 11:10:17,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {1470#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1470#true} is VALID [2018-11-23 11:10:17,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {1470#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1470#true} is VALID [2018-11-23 11:10:17,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {1470#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {1470#true} is VALID [2018-11-23 11:10:17,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {1470#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1470#true} is VALID [2018-11-23 11:10:17,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {1470#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1470#true} is VALID [2018-11-23 11:10:17,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {1470#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1470#true} is VALID [2018-11-23 11:10:17,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {1470#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1520#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:17,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {1520#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1520#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:17,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {1520#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:17,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:17,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:17,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {1527#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1537#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:17,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {1537#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1541#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:17,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {1541#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {1471#false} is VALID [2018-11-23 11:10:17,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {1471#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1471#false} is VALID [2018-11-23 11:10:17,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {1471#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {1471#false} is VALID [2018-11-23 11:10:17,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {1471#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1471#false} is VALID [2018-11-23 11:10:17,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {1471#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {1471#false} is VALID [2018-11-23 11:10:17,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {1471#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1471#false} is VALID [2018-11-23 11:10:17,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {1471#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {1471#false} is VALID [2018-11-23 11:10:17,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {1471#false} assume !false; {1471#false} is VALID [2018-11-23 11:10:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:17,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:17,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:10:17,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:10:17,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:17,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:18,052 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:10:18,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:18,053 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 6 states. [2018-11-23 11:10:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:19,730 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-11-23 11:10:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:19,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:10:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:10:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:10:19,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-23 11:10:19,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:19,909 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:10:19,910 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:10:19,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:10:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-11-23 11:10:19,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:19,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 52 states. [2018-11-23 11:10:19,934 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 52 states. [2018-11-23 11:10:19,934 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 52 states. [2018-11-23 11:10:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:19,937 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2018-11-23 11:10:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2018-11-23 11:10:19,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:19,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:19,938 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 64 states. [2018-11-23 11:10:19,939 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 64 states. [2018-11-23 11:10:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:19,942 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2018-11-23 11:10:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2018-11-23 11:10:19,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:19,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:19,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:19,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:10:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2018-11-23 11:10:19,963 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 30 [2018-11-23 11:10:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:19,968 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2018-11-23 11:10:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2018-11-23 11:10:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:10:19,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:19,969 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:19,969 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:19,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1417006922, now seen corresponding path program 1 times [2018-11-23 11:10:19,972 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:19,974 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:10:19,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:20,173 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:10:20,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:20,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:20,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_21| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:10:20,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:20,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:20,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:20,335 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:10:20,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,362 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:10:20,372 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:10:20,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:10:20,405 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:20,406 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_#valid_22|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_22| main_~t~0.base)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (bvadd (select |v_#valid_22| main_~a~0.base) (_ bv1 1))) (= (store |v_#memory_int_39| main_~p~0.base (store (select |v_#memory_int_39| main_~p~0.base) main_~p~0.offset (_ bv2 32))) |#memory_int|)) [2018-11-23 11:10:20,406 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:10:20,483 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 27 treesize of output 22 [2018-11-23 11:10:20,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:20,495 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 22 treesize of output 14 [2018-11-23 11:10:20,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:10:20,819 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 20 [2018-11-23 11:10:20,827 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:10:20,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:20,927 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:10:20,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:10:20,937 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:20,937 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, v_main_~p~0.base_21, v_main_~p~0.offset_21]. (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |v_#memory_int_41| main_~p~0.base) (_ bv0 32)) (_ bv2 32)) (= (store |v_#memory_int_41| v_main_~p~0.base_21 (store (select |v_#memory_int_41| v_main_~p~0.base_21) v_main_~p~0.offset_21 (_ bv3 32))) |#memory_int|) (not (= v_main_~p~0.base_21 main_~p~0.base))) [2018-11-23 11:10:20,938 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_21, v_main_~p~0.offset_21]. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv2 32)) (not (= v_main_~p~0.base_21 main_~p~0.base))) [2018-11-23 11:10:21,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2018-11-23 11:10:21,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {1853#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1853#true} is VALID [2018-11-23 11:10:21,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {1853#true} assume true; {1853#true} is VALID [2018-11-23 11:10:21,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1853#true} {1853#true} #200#return; {1853#true} is VALID [2018-11-23 11:10:21,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {1853#true} call #t~ret39 := main(); {1853#true} is VALID [2018-11-23 11:10:21,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1853#true} is VALID [2018-11-23 11:10:21,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {1853#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1853#true} is VALID [2018-11-23 11:10:21,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {1853#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1853#true} is VALID [2018-11-23 11:10:21,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {1853#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1853#true} is VALID [2018-11-23 11:10:21,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {1853#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1853#true} is VALID [2018-11-23 11:10:21,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {1853#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1853#true} is VALID [2018-11-23 11:10:21,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {1853#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {1853#true} is VALID [2018-11-23 11:10:21,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {1853#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1853#true} is VALID [2018-11-23 11:10:21,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {1853#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1853#true} is VALID [2018-11-23 11:10:21,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {1853#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1853#true} is VALID [2018-11-23 11:10:21,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {1853#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1903#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:21,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {1903#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1903#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:21,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {1903#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1910#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:21,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {1910#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {1910#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:21,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {1917#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:21,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {1917#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1917#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:21,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1917#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {1924#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:21,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {1924#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {1924#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:21,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {1924#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:21,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:21,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:21,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {1931#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1941#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|))} is VALID [2018-11-23 11:10:21,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {1941#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {1854#false} is VALID [2018-11-23 11:10:21,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {1854#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1854#false} is VALID [2018-11-23 11:10:21,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {1854#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {1854#false} is VALID [2018-11-23 11:10:21,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2018-11-23 11:10:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:21,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:21,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:21,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:21,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:21,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:21,503 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 2 xjuncts. [2018-11-23 11:10:21,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 11:10:21,516 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:21,516 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_43|, v_subst_1]. (or (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_43| main_~p~0.base) .cse0)))) |v_#memory_int_43|)) (= (_ bv0 32) (bvadd (select (select (store |v_#memory_int_43| main_~t~0.base (store (select |v_#memory_int_43| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)))) [2018-11-23 11:10:21,517 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_2]. (and (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:10:21,753 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 29 treesize of output 33 [2018-11-23 11:10:21,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:10:21,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:21,840 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:21,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-23 11:10:21,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:10:21,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:21,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:22,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:22,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:10:22,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:10:22,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:22,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:22,037 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 26 treesize of output 24 [2018-11-23 11:10:22,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:10:22,090 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 15 treesize of output 6 [2018-11-23 11:10:22,091 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:22,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:10:22,099 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:22,121 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:22,157 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:22,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:10:22,212 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:34, output treesize:42 [2018-11-23 11:10:22,220 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:22,220 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_2, v_main_~t~0.base_10]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv2 32)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))) [2018-11-23 11:10:22,221 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~t~0.base_10, v_prenex_3, v_prenex_2]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset))) (and (or .cse0 (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10)))) (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_3)))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))))) [2018-11-23 11:10:22,561 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-11-23 11:10:22,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2018-11-23 11:10:22,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {1854#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {1854#false} is VALID [2018-11-23 11:10:22,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {1854#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1854#false} is VALID [2018-11-23 11:10:22,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {1963#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {1854#false} is VALID [2018-11-23 11:10:22,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1963#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:22,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:22,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:22,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {1977#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1967#(= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:22,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {1977#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {1977#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:22,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {1984#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {1977#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:22,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {1984#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1984#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:22,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {1984#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:22,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {1991#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-23 11:10:22,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1991#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-23 11:10:22,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {1998#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1998#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:22,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {1853#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {1998#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:22,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {1853#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {1853#true} is VALID [2018-11-23 11:10:22,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {1853#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1853#true} is VALID [2018-11-23 11:10:22,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {1853#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {1853#true} is VALID [2018-11-23 11:10:22,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {1853#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {1853#true} is VALID [2018-11-23 11:10:22,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {1853#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {1853#true} is VALID [2018-11-23 11:10:22,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {1853#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {1853#true} is VALID [2018-11-23 11:10:22,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {1853#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {1853#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {1853#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {1853#true} call #t~ret39 := main(); {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1853#true} {1853#true} #200#return; {1853#true} is VALID [2018-11-23 11:10:22,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {1853#true} assume true; {1853#true} is VALID [2018-11-23 11:10:22,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {1853#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1853#true} is VALID [2018-11-23 11:10:22,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2018-11-23 11:10:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:10:22,689 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:10:22,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:22,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:10:22,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:22,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:10:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:10:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:10:22,775 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand 14 states. [2018-11-23 11:10:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:30,026 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2018-11-23 11:10:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:10:30,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:10:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-23 11:10:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-23 11:10:30,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2018-11-23 11:10:30,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:30,208 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:10:30,208 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:10:30,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:10:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:10:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-11-23 11:10:30,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:30,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 60 states. [2018-11-23 11:10:30,237 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 60 states. [2018-11-23 11:10:30,237 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 60 states. [2018-11-23 11:10:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:30,240 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-23 11:10:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2018-11-23 11:10:30,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:30,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:30,241 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 72 states. [2018-11-23 11:10:30,241 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 72 states. [2018-11-23 11:10:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:30,244 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-23 11:10:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2018-11-23 11:10:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:30,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:30,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:10:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2018-11-23 11:10:30,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2018-11-23 11:10:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:30,248 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2018-11-23 11:10:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:10:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-11-23 11:10:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:10:30,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:30,249 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:30,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:30,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1039451941, now seen corresponding path program 1 times [2018-11-23 11:10:30,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:30,250 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:10:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:30,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:30,405 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:10:30,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:30,420 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:30,420 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_28|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_28| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:10:30,420 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:30,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:30,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:30,524 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:10:30,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,555 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:10:30,561 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:10:30,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,584 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:10:30,593 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:30,594 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, |v_#valid_29|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_29| main_~a~0.base) (_ bv1 1))) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (select |v_#valid_29| main_~t~0.base)) (= (store |v_#memory_int_45| main_~p~0.base (store (select |v_#memory_int_45| main_~p~0.base) main_~p~0.offset (_ bv1 32))) |#memory_int|)) [2018-11-23 11:10:30,594 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:10:30,669 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 27 treesize of output 22 [2018-11-23 11:10:30,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:30,685 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 22 treesize of output 14 [2018-11-23 11:10:30,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:10:30,921 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 20 [2018-11-23 11:10:30,941 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:10:30,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:30,980 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:10:30,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:10:30,991 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:30,992 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, v_main_~p~0.base_26, v_main_~p~0.offset_26]. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |v_#memory_int_47| main_~p~0.base) (_ bv0 32))) (= (store |v_#memory_int_47| v_main_~p~0.base_26 (store (select |v_#memory_int_47| v_main_~p~0.base_26) v_main_~p~0.offset_26 (_ bv3 32))) |#memory_int|) (not (= v_main_~p~0.base_26 main_~p~0.base))) [2018-11-23 11:10:30,992 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_26, v_main_~p~0.offset_26]. (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv3 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:10:31,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2018-11-23 11:10:31,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {2373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2373#true} is VALID [2018-11-23 11:10:31,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2018-11-23 11:10:31,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #200#return; {2373#true} is VALID [2018-11-23 11:10:31,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret39 := main(); {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {2373#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {2373#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {2373#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {2373#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {2373#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2373#true} is VALID [2018-11-23 11:10:31,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {2373#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {2373#true} is VALID [2018-11-23 11:10:31,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {2373#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2373#true} is VALID [2018-11-23 11:10:31,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {2373#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2373#true} is VALID [2018-11-23 11:10:31,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {2373#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2373#true} is VALID [2018-11-23 11:10:31,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {2373#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2423#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:31,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {2423#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2423#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:31,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {2423#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2430#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:31,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {2430#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet28);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {2434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:31,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {2434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:31,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {2434#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:31,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:31,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:31,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {2441#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2451#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:31,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {2451#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2455#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem34|))} is VALID [2018-11-23 11:10:31,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {2455#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem34|))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {2374#false} is VALID [2018-11-23 11:10:31,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {2374#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2374#false} is VALID [2018-11-23 11:10:31,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {2374#false} is VALID [2018-11-23 11:10:31,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {2374#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2374#false} is VALID [2018-11-23 11:10:31,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {2374#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {2374#false} is VALID [2018-11-23 11:10:31,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2018-11-23 11:10:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:31,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:31,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:31,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:31,514 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 2 xjuncts. [2018-11-23 11:10:31,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 11:10:31,529 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:31,529 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_49|, v_subst_2]. (or (= (bvadd (select (select (store |v_#memory_int_49| main_~t~0.base (store (select |v_#memory_int_49| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_49| main_~p~0.base) .cse0)))) |v_#memory_int_49|))) [2018-11-23 11:10:31,529 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_8]. (and (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:10:31,775 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 29 treesize of output 33 [2018-11-23 11:10:31,788 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:10:31,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-23 11:10:31,884 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 13 treesize of output 6 [2018-11-23 11:10:31,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:10:31,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:31,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:31,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 11:10:32,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:10:32,072 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,093 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:32,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:32,135 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 26 treesize of output 24 [2018-11-23 11:10:32,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:10:32,174 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:10:32,176 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,181 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 13 treesize of output 6 [2018-11-23 11:10:32,183 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,207 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:32,241 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:32,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:10:32,251 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:10:32,252 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,260 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:10:32,311 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:34, output treesize:42 [2018-11-23 11:10:32,321 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:32,321 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_8, v_main_~t~0.base_12]. (and (or (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1)))) [2018-11-23 11:10:32,322 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~t~0.base_12, v_prenex_5, v_prenex_6]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset))) (and (or (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1))) .cse0) (or (not (= (select |#valid| v_prenex_5) (_ bv0 1))) (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (not (= (select |#valid| v_prenex_6) (_ bv0 1))) (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) .cse0))) [2018-11-23 11:10:32,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2018-11-23 11:10:32,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {2374#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {2374#false} is VALID [2018-11-23 11:10:32,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {2374#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2374#false} is VALID [2018-11-23 11:10:32,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {2374#false} is VALID [2018-11-23 11:10:32,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {2374#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2374#false} is VALID [2018-11-23 11:10:32,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {2489#(= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {2374#false} is VALID [2018-11-23 11:10:32,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {2493#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2489#(= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:32,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2493#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:32,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:32,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:32,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {2507#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {2497#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:32,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {2507#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2507#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:10:32,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {2514#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet28);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {2507#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:10:32,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {2518#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2514#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_main_~t~0.base_12 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_12) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} is VALID [2018-11-23 11:10:32,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {2518#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2518#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:32,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {2373#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2518#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:32,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {2373#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2373#true} is VALID [2018-11-23 11:10:32,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {2373#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2373#true} is VALID [2018-11-23 11:10:32,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {2373#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2373#true} is VALID [2018-11-23 11:10:32,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {2373#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {2373#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {2373#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {2373#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {2373#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2373#true} is VALID [2018-11-23 11:10:32,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {2373#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2373#true} is VALID [2018-11-23 11:10:32,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret39 := main(); {2373#true} is VALID [2018-11-23 11:10:32,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #200#return; {2373#true} is VALID [2018-11-23 11:10:32,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2018-11-23 11:10:32,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {2373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2373#true} is VALID [2018-11-23 11:10:32,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2018-11-23 11:10:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:32,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:32,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:10:32,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:10:32,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:32,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:10:32,550 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:10:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:10:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:10:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:10:32,551 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 14 states. [2018-11-23 11:10:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:38,963 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-23 11:10:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:10:38,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:10:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 11:10:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 11:10:38,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2018-11-23 11:10:39,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:39,223 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:10:39,223 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:10:39,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:10:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:10:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-23 11:10:39,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:39,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 62 states. [2018-11-23 11:10:39,259 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 62 states. [2018-11-23 11:10:39,260 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 62 states. [2018-11-23 11:10:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:39,263 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 11:10:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2018-11-23 11:10:39,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:39,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:39,264 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 66 states. [2018-11-23 11:10:39,264 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 66 states. [2018-11-23 11:10:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:39,266 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 11:10:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2018-11-23 11:10:39,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:39,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:39,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:39,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:10:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2018-11-23 11:10:39,269 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 31 [2018-11-23 11:10:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:39,270 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2018-11-23 11:10:39,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:10:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-11-23 11:10:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:10:39,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:39,271 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:10:39,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash 287698981, now seen corresponding path program 1 times [2018-11-23 11:10:39,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:39,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:39,457 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:10:39,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:39,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:39,469 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_35|]. (and (= main_~a~0.offset (_ bv0 32)) (= (store |v_#valid_35| main_~a~0.base (_ bv1 1)) |#valid|)) [2018-11-23 11:10:39,469 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:39,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,693 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:10:39,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:10:39,711 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:39,712 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_36|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |v_#valid_36| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (select |v_#valid_36| main_~t~0.base))) [2018-11-23 11:10:39,712 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:10:39,798 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 13 treesize of output 10 [2018-11-23 11:10:39,808 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:10:39,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,866 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 13 treesize of output 10 [2018-11-23 11:10:39,873 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 10 treesize of output 9 [2018-11-23 11:10:39,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:10:39,945 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:39,945 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_50|, main_~t~0.base, |v_#memory_$Pointer$.offset_48|, main_~t~0.offset]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= (store |v_#memory_$Pointer$.base_50| main_~a~0.base (store (select |v_#memory_$Pointer$.base_50| main_~a~0.base) .cse0 main_~t~0.base)) |#memory_$Pointer$.base|) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_48| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_48| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|))) [2018-11-23 11:10:39,945 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:10:40,083 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 102 treesize of output 98 [2018-11-23 11:10:40,092 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 28 treesize of output 1 [2018-11-23 11:10:40,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,166 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 23 treesize of output 16 [2018-11-23 11:10:40,171 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 16 treesize of output 15 [2018-11-23 11:10:40,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,218 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 51 treesize of output 52 [2018-11-23 11:10:40,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 28 treesize of output 1 [2018-11-23 11:10:40,227 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,248 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:10:40,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:40,414 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_51|, |v_#memory_int_51|, |v_#memory_$Pointer$.offset_49|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_51| main_~p~0.base) (_ bv4 32))) (.cse1 (select (select |v_#memory_$Pointer$.offset_49| main_~p~0.base) (_ bv4 32)))) (and (= (store |v_#memory_int_51| .cse0 (store (select |v_#memory_int_51| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_49| .cse0 (store (select |v_#memory_$Pointer$.offset_49| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (not (= .cse0 main_~p~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_51| .cse0 (store (select |v_#memory_$Pointer$.base_51| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))))) [2018-11-23 11:10:40,414 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:10:40,466 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 25 treesize of output 21 [2018-11-23 11:10:40,476 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:10:40,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,496 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 23 [2018-11-23 11:10:40,501 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 23 treesize of output 14 [2018-11-23 11:10:40,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,523 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:10:40,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:10:40,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:40,527 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_32, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_32) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_32) (_ bv4 32)))) (and (= main_~p~0.offset .cse0) (= .cse1 main_~p~0.base) (= (bvadd (select (select |#memory_int| .cse1) .cse0) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_32 .cse1)))) [2018-11-23 11:10:40,528 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:10:40,554 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:10:40,558 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:10:40,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:10:40,565 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:40,565 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem38|))) [2018-11-23 11:10:40,565 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem38| (_ bv3 32)) [2018-11-23 11:10:40,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2018-11-23 11:10:40,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {2878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2878#true} is VALID [2018-11-23 11:10:40,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2018-11-23 11:10:40,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #200#return; {2878#true} is VALID [2018-11-23 11:10:40,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret39 := main(); {2878#true} is VALID [2018-11-23 11:10:40,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {2878#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2878#true} is VALID [2018-11-23 11:10:40,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {2878#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2878#true} is VALID [2018-11-23 11:10:40,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {2878#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2878#true} is VALID [2018-11-23 11:10:40,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2878#true} is VALID [2018-11-23 11:10:40,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {2878#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2878#true} is VALID [2018-11-23 11:10:40,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2878#true} is VALID [2018-11-23 11:10:40,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {2878#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {2878#true} is VALID [2018-11-23 11:10:40,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {2878#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2878#true} is VALID [2018-11-23 11:10:40,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2878#true} is VALID [2018-11-23 11:10:40,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {2878#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2878#true} is VALID [2018-11-23 11:10:40,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {2878#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {2928#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:40,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {2928#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2928#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:40,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {2928#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2935#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:40,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {2935#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {2935#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:40,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {2935#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {2942#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:40,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {2942#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2942#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:40,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {2942#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {2949#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:40,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {2949#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {2949#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:40,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {2949#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:40,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:40,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:40,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:40,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {2956#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:40,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:40,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:40,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2979#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:40,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {2979#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume 3bv32 != #t~mem38;havoc #t~mem38; {2879#false} is VALID [2018-11-23 11:10:40,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2018-11-23 11:10:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:40,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:40,834 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-23 11:10:40,843 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 19 treesize of output 11 [2018-11-23 11:10:40,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:10:40,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,936 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:10:40,946 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:10:40,991 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:41,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:41,020 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,027 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:41,048 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:60, output treesize:35 [2018-11-23 11:10:41,353 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:41,354 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_52|, |v_#memory_$Pointer$.offset_50|]. (or (not (= |v_#memory_$Pointer$.base_52| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_52| main_~p~0.base) main_~p~0.offset))))) (not (= |v_#memory_$Pointer$.offset_50| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_50| main_~p~0.base) main_~p~0.offset))))) (= (_ bv3 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_52| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_50| main_~a~0.base) .cse0))))) [2018-11-23 11:10:41,354 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_14, v_DerPreprocessor_12]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) .cse0)) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) .cse0) main_~p~0.base))) [2018-11-23 11:10:41,571 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 37 treesize of output 29 [2018-11-23 11:10:41,648 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 11 treesize of output 10 [2018-11-23 11:10:41,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,725 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 20 treesize of output 24 [2018-11-23 11:10:41,733 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 11 [2018-11-23 11:10:41,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:10:41,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,821 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:10:41,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:41,841 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 21 treesize of output 19 [2018-11-23 11:10:41,855 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 8 treesize of output 1 [2018-11-23 11:10:41,856 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,866 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:10:42,072 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 37 treesize of output 29 [2018-11-23 11:10:42,144 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 11 treesize of output 10 [2018-11-23 11:10:42,146 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,230 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 20 treesize of output 24 [2018-11-23 11:10:42,241 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:10:42,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,281 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 12 treesize of output 3 [2018-11-23 11:10:42,283 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:10:42,316 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,324 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:42,329 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 21 treesize of output 19 [2018-11-23 11:10:42,343 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 8 treesize of output 1 [2018-11-23 11:10:42,345 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,353 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,390 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:10:42,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:10:42,530 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:10:42,543 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:42,543 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.offset|, v_main_~p~0.offset_35, v_DerPreprocessor_14, |#memory_$Pointer$.base|, v_prenex_7, v_DerPreprocessor_12]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (let ((.cse0 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 v_main_~p~0.offset_35)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_main_~p~0.offset_35 v_DerPreprocessor_14))) main_~a~0.base) .cse2) v_main_~p~0.offset_35) (= main_~t~0.base (select (select (let ((.cse3 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) v_prenex_7 v_DerPreprocessor_12))) main_~a~0.base) .cse2)))) [2018-11-23 11:10:42,543 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:10:42,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2018-11-23 11:10:42,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {2979#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} assume 3bv32 != #t~mem38;havoc #t~mem38; {2879#false} is VALID [2018-11-23 11:10:42,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2979#(= (bvadd |main_#t~mem38| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:42,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:42,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:42,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {2969#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:42,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:42,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:42,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:42,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {3014#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3001#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:42,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {3014#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3014#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:10:42,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {3021#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {3014#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:10:42,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {3021#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3021#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:42,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {3028#(and (or (forall ((v_main_~t~0.base_14 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {3021#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:42,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {3028#(and (or (forall ((v_main_~t~0.base_14 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {3028#(and (or (forall ((v_main_~t~0.base_14 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:10:42,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {3035#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3028#(and (or (forall ((v_main_~t~0.base_14 (_ BitVec 32))) (not (= (select |#valid| v_main_~t~0.base_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))))} is VALID [2018-11-23 11:10:42,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {3035#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3035#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:42,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {2878#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {3035#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:42,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {2878#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {2878#true} is VALID [2018-11-23 11:10:42,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2878#true} is VALID [2018-11-23 11:10:42,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {2878#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {2878#true} is VALID [2018-11-23 11:10:42,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {2878#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {2878#true} is VALID [2018-11-23 11:10:42,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {2878#true} is VALID [2018-11-23 11:10:42,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {2878#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {2878#true} is VALID [2018-11-23 11:10:42,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2878#true} is VALID [2018-11-23 11:10:42,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {2878#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {2878#true} is VALID [2018-11-23 11:10:42,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {2878#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2878#true} is VALID [2018-11-23 11:10:42,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {2878#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {2878#true} is VALID [2018-11-23 11:10:42,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret39 := main(); {2878#true} is VALID [2018-11-23 11:10:42,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #200#return; {2878#true} is VALID [2018-11-23 11:10:42,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2018-11-23 11:10:42,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {2878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2878#true} is VALID [2018-11-23 11:10:42,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2018-11-23 11:10:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:42,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:42,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 11:10:42,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:10:42,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:42,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:10:42,917 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:10:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:10:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:10:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:10:42,918 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand 14 states. [2018-11-23 11:10:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:49,751 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2018-11-23 11:10:49,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:10:49,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:10:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-23 11:10:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-23 11:10:49,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2018-11-23 11:10:49,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:49,965 INFO L225 Difference]: With dead ends: 91 [2018-11-23 11:10:49,966 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 11:10:49,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:10:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 11:10:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-11-23 11:10:50,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:50,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 77 states. [2018-11-23 11:10:50,092 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 77 states. [2018-11-23 11:10:50,093 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 77 states. [2018-11-23 11:10:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:50,096 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2018-11-23 11:10:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2018-11-23 11:10:50,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:50,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:50,096 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 87 states. [2018-11-23 11:10:50,097 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 87 states. [2018-11-23 11:10:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:50,100 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2018-11-23 11:10:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2018-11-23 11:10:50,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:50,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:50,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:50,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:10:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2018-11-23 11:10:50,103 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 33 [2018-11-23 11:10:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:50,104 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2018-11-23 11:10:50,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:10:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2018-11-23 11:10:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:10:50,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:50,105 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:10:50,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:50,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1649493568, now seen corresponding path program 2 times [2018-11-23 11:10:50,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:50,127 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:10:50,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:10:50,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:10:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:50,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:50,324 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:10:50,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:50,338 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:50,338 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_42|]. (and (= main_~a~0.offset (_ bv0 32)) (= (store |v_#valid_42| main_~a~0.base (_ bv1 1)) |#valid|)) [2018-11-23 11:10:50,339 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:50,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:50,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:50,411 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:10:50,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:10:50,430 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:50,430 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_43|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |v_#valid_43| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (select |v_#valid_43| main_~t~0.base))) [2018-11-23 11:10:50,430 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:10:50,492 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 13 treesize of output 10 [2018-11-23 11:10:50,500 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:10:50,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,557 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 13 treesize of output 10 [2018-11-23 11:10:50,564 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 10 treesize of output 9 [2018-11-23 11:10:50,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:10:50,629 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:50,629 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_55|, main_~t~0.base, |v_#memory_$Pointer$.offset_53|, main_~t~0.offset]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_55| main_~a~0.base (store (select |v_#memory_$Pointer$.base_55| main_~a~0.base) .cse0 main_~t~0.base))) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (store |v_#memory_$Pointer$.offset_53| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_53| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (not (= main_~t~0.base main_~a~0.base)))) [2018-11-23 11:10:50,630 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:10:50,747 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 23 treesize of output 16 [2018-11-23 11:10:50,755 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 16 treesize of output 15 [2018-11-23 11:10:50,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,836 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 86 treesize of output 87 [2018-11-23 11:10:50,842 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 28 treesize of output 1 [2018-11-23 11:10:50,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,898 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 59 treesize of output 55 [2018-11-23 11:10:50,904 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 28 treesize of output 1 [2018-11-23 11:10:50,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:50,931 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:10:50,994 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:50,994 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_56|, |v_#memory_int_55|, |v_#memory_$Pointer$.offset_54|]. (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_54| main_~p~0.base) (_ bv4 32))) (.cse0 (select (select |v_#memory_$Pointer$.base_56| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_54| .cse0 (store (select |v_#memory_$Pointer$.offset_54| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_56| .cse0 (store (select |v_#memory_$Pointer$.base_56| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_int_55| .cse0 (store (select |v_#memory_int_55| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (not (= main_~p~0.base .cse0)))) [2018-11-23 11:10:50,994 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:10:51,051 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 25 treesize of output 21 [2018-11-23 11:10:51,058 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:10:51,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,079 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 23 [2018-11-23 11:10:51,084 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 23 treesize of output 14 [2018-11-23 11:10:51,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,105 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:10:51,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:10:51,110 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:51,110 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)))) (and (not (= v_main_~p~0.base_39 .cse0)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (= (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967293 32)) (_ bv0 32)))) [2018-11-23 11:10:51,110 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:10:51,136 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:10:51,143 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:10:51,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:10:51,151 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:51,151 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem36|))) [2018-11-23 11:10:51,151 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| (_ bv3 32)) [2018-11-23 11:10:51,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {3478#true} call ULTIMATE.init(); {3478#true} is VALID [2018-11-23 11:10:51,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {3478#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3478#true} is VALID [2018-11-23 11:10:51,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {3478#true} assume true; {3478#true} is VALID [2018-11-23 11:10:51,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} #200#return; {3478#true} is VALID [2018-11-23 11:10:51,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {3478#true} call #t~ret39 := main(); {3478#true} is VALID [2018-11-23 11:10:51,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {3478#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {3478#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {3478#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {3478#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {3478#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {3478#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {3478#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {3478#true} is VALID [2018-11-23 11:10:51,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {3478#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {3478#true} is VALID [2018-11-23 11:10:51,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {3478#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3478#true} is VALID [2018-11-23 11:10:51,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {3478#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {3478#true} is VALID [2018-11-23 11:10:51,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {3478#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {3528#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:51,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {3528#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3528#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:51,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {3528#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3535#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:51,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {3535#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {3535#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:51,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {3535#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {3542#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:51,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {3542#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3542#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:51,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {3542#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {3549#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:51,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {3549#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3549#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:51,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {3549#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:51,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:51,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:51,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:10:51,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {3556#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3569#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:10:51,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {3569#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3573#(= (bvadd |main_#t~mem36| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:51,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {3573#(= (bvadd |main_#t~mem36| (_ bv4294967293 32)) (_ bv0 32))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3479#false} is VALID [2018-11-23 11:10:51,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {3479#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3479#false} is VALID [2018-11-23 11:10:51,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {3479#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {3479#false} is VALID [2018-11-23 11:10:51,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {3479#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3479#false} is VALID [2018-11-23 11:10:51,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {3479#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {3479#false} is VALID [2018-11-23 11:10:51,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {3479#false} assume !false; {3479#false} is VALID [2018-11-23 11:10:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:51,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:51,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-23 11:10:51,580 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 22 treesize of output 1 [2018-11-23 11:10:51,581 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,593 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 46 treesize of output 38 [2018-11-23 11:10:51,606 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 20 treesize of output 1 [2018-11-23 11:10:51,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,617 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,670 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,678 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:51,690 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,698 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:51,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:51,723 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-11-23 11:10:51,756 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:51,756 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|]. (or (not (= (_ bv2 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_57| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_55| main_~a~0.base) .cse0))))) (not (= (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_55| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.offset_55|)) (not (= (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_57| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.base_57|))) [2018-11-23 11:10:51,756 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_22, v_DerPreprocessor_18]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_22)) main_~a~0.base) .cse0) main_~p~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) .cse0) main_~p~0.offset))) [2018-11-23 11:10:51,941 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 37 treesize of output 29 [2018-11-23 11:10:52,018 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 11 treesize of output 10 [2018-11-23 11:10:52,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,101 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 20 treesize of output 24 [2018-11-23 11:10:52,113 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 11 [2018-11-23 11:10:52,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:10:52,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,194 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:10:52,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:52,214 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 21 treesize of output 19 [2018-11-23 11:10:52,222 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 8 treesize of output 1 [2018-11-23 11:10:52,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:10:52,418 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 37 treesize of output 29 [2018-11-23 11:10:52,500 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 11 treesize of output 10 [2018-11-23 11:10:52,502 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,590 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 20 treesize of output 24 [2018-11-23 11:10:52,604 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:10:52,607 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:10:52,653 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,686 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 12 treesize of output 3 [2018-11-23 11:10:52,690 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,700 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:52,706 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 21 treesize of output 19 [2018-11-23 11:10:52,715 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 8 treesize of output 1 [2018-11-23 11:10:52,716 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,724 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,764 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:10:52,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:10:52,945 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:10:52,961 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:52,961 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_prenex_11, v_DerPreprocessor_22, |#memory_$Pointer$.offset|, main_~t~0.offset, v_DerPreprocessor_18]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_prenex_11 v_DerPreprocessor_22))) main_~a~0.base) .cse2)) (= main_~t~0.offset (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 main_~t~0.offset)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_18))) main_~a~0.base) .cse2)))) [2018-11-23 11:10:52,961 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:10:53,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {3479#false} assume !false; {3479#false} is VALID [2018-11-23 11:10:53,190 INFO L273 TraceCheckUtils]: 33: Hoare triple {3479#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {3479#false} is VALID [2018-11-23 11:10:53,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {3479#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3479#false} is VALID [2018-11-23 11:10:53,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {3479#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {3479#false} is VALID [2018-11-23 11:10:53,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {3479#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3479#false} is VALID [2018-11-23 11:10:53,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {3607#(not (= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32)))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3479#false} is VALID [2018-11-23 11:10:53,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {3611#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3607#(not (= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:53,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3611#(not (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:10:53,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:53,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:53,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:53,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {3628#(and (forall ((v_DerPreprocessor_22 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_22)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3615#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:53,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {3628#(and (forall ((v_DerPreprocessor_22 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_22)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3628#(and (forall ((v_DerPreprocessor_22 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_22)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} is VALID [2018-11-23 11:10:53,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {3635#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {3628#(and (forall ((v_DerPreprocessor_22 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_22)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} is VALID [2018-11-23 11:10:53,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {3635#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {3635#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:53,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {3642#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc32.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc32.base_4|) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (or (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {3635#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:10:53,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {3642#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc32.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc32.base_4|) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (or (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {3642#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc32.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc32.base_4|) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (or (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)))} is VALID [2018-11-23 11:10:53,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {3649#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3642#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc32.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc32.base_4|) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)) (or (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)))} is VALID [2018-11-23 11:10:53,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {3649#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {3649#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:53,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {3478#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {3649#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:53,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {3478#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {3478#true} is VALID [2018-11-23 11:10:53,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {3478#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3478#true} is VALID [2018-11-23 11:10:53,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {3478#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {3478#true} is VALID [2018-11-23 11:10:53,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {3478#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {3478#true} is VALID [2018-11-23 11:10:53,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {3478#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {3478#true} is VALID [2018-11-23 11:10:53,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {3478#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {3478#true} is VALID [2018-11-23 11:10:53,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {3478#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3478#true} is VALID [2018-11-23 11:10:53,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {3478#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {3478#true} is VALID [2018-11-23 11:10:53,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {3478#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {3478#true} is VALID [2018-11-23 11:10:53,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {3478#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {3478#true} is VALID [2018-11-23 11:10:53,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {3478#true} call #t~ret39 := main(); {3478#true} is VALID [2018-11-23 11:10:53,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} #200#return; {3478#true} is VALID [2018-11-23 11:10:53,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {3478#true} assume true; {3478#true} is VALID [2018-11-23 11:10:53,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {3478#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3478#true} is VALID [2018-11-23 11:10:53,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {3478#true} call ULTIMATE.init(); {3478#true} is VALID [2018-11-23 11:10:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:10:53,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 11:10:53,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:53,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:10:53,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:53,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:10:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:10:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:10:53,321 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 16 states. [2018-11-23 11:11:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,114 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2018-11-23 11:11:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:11:01,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 11:11:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 11:11:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 11:11:01,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 94 transitions. [2018-11-23 11:11:01,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:01,308 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:11:01,308 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:11:01,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:11:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:11:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-11-23 11:11:01,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:01,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 72 states. [2018-11-23 11:11:01,367 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 72 states. [2018-11-23 11:11:01,368 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 72 states. [2018-11-23 11:11:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,372 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2018-11-23 11:11:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2018-11-23 11:11:01,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,373 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 83 states. [2018-11-23 11:11:01,373 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 83 states. [2018-11-23 11:11:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,376 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2018-11-23 11:11:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2018-11-23 11:11:01,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:01,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:11:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-23 11:11:01,379 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 35 [2018-11-23 11:11:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:01,379 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-23 11:11:01,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:11:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2018-11-23 11:11:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:11:01,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:01,380 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:11:01,380 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -428721600, now seen corresponding path program 1 times [2018-11-23 11:11:01,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:01,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:11:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:01,552 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:11:01,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:11:01,566 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:01,566 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_49|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_49| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:11:01,566 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:11:01,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:01,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:01,636 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:11:01,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,665 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:11:01,671 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:11:01,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,694 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:11:01,702 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:01,702 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_59|, |v_#valid_50|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (store |v_#memory_int_59| main_~p~0.base (store (select |v_#memory_int_59| main_~p~0.base) main_~p~0.offset (_ bv2 32))) |#memory_int|) (= (bvadd (select |v_#valid_50| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (select |v_#valid_50| main_~t~0.base))) [2018-11-23 11:11:01,702 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:11:01,760 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 27 treesize of output 22 [2018-11-23 11:11:01,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:01,772 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 22 treesize of output 14 [2018-11-23 11:11:01,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:11:01,845 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 20 [2018-11-23 11:11:01,881 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:11:01,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,172 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:11:02,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:11:02,190 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:02,190 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|, v_main_~p~0.base_46, v_main_~p~0.offset_46]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_46 main_~p~0.base)) (= (_ bv2 32) (select (select |v_#memory_int_61| main_~p~0.base) (_ bv0 32))) (= (store |v_#memory_int_61| v_main_~p~0.base_46 (store (select |v_#memory_int_61| v_main_~p~0.base_46) v_main_~p~0.offset_46 (_ bv3 32))) |#memory_int|)) [2018-11-23 11:11:02,190 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_46, v_main_~p~0.offset_46]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_46 main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv2 32)) (= (select (select |#memory_int| v_main_~p~0.base_46) v_main_~p~0.offset_46) (_ bv3 32))) [2018-11-23 11:11:02,474 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 26 treesize of output 24 [2018-11-23 11:11:02,482 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 13 treesize of output 5 [2018-11-23 11:11:02,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,494 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 7 treesize of output 1 [2018-11-23 11:11:02,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:5 [2018-11-23 11:11:02,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:02,511 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_46, v_main_~p~0.offset_46, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_46) v_main_~p~0.offset_46) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_46 main_~p~0.base)) (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~mem34| .cse0))) [2018-11-23 11:11:02,511 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem34| (_ bv4294967294 32))) [2018-11-23 11:11:02,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {4086#true} call ULTIMATE.init(); {4086#true} is VALID [2018-11-23 11:11:02,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {4086#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4086#true} is VALID [2018-11-23 11:11:02,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 11:11:02,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4086#true} {4086#true} #200#return; {4086#true} is VALID [2018-11-23 11:11:02,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {4086#true} call #t~ret39 := main(); {4086#true} is VALID [2018-11-23 11:11:02,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {4086#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {4086#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {4086#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {4086#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {4086#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {4086#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4086#true} is VALID [2018-11-23 11:11:02,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {4086#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {4086#true} is VALID [2018-11-23 11:11:02,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {4086#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4086#true} is VALID [2018-11-23 11:11:02,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {4086#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4086#true} is VALID [2018-11-23 11:11:02,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {4086#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4086#true} is VALID [2018-11-23 11:11:02,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {4086#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4136#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:02,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {4136#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4136#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:02,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {4136#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4143#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:02,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {4143#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {4143#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:02,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {4143#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {4150#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:11:02,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {4150#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4150#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:11:02,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {4150#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {4157#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:11:02,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {4157#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {4157#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:11:02,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {4157#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4164#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_46 (_ BitVec 32)) (v_main_~p~0.offset_46 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_46) v_main_~p~0.offset_46) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_46 main_~p~0.base)))))} is VALID [2018-11-23 11:11:02,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {4164#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_46 (_ BitVec 32)) (v_main_~p~0.offset_46 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_46) v_main_~p~0.offset_46) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_46 main_~p~0.base)))))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4168#(= (_ bv2 32) |main_#t~mem34|)} is VALID [2018-11-23 11:11:02,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {4168#(= (_ bv2 32) |main_#t~mem34|)} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4087#false} is VALID [2018-11-23 11:11:02,551 INFO L273 TraceCheckUtils]: 26: Hoare triple {4087#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:02,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {4087#false} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4087#false} is VALID [2018-11-23 11:11:02,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {4087#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:02,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {4087#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {4087#false} is VALID [2018-11-23 11:11:02,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {4087#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:02,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {4087#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {4087#false} is VALID [2018-11-23 11:11:02,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {4087#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:02,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {4087#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {4087#false} is VALID [2018-11-23 11:11:02,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {4087#false} assume !false; {4087#false} is VALID [2018-11-23 11:11:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:11:02,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:02,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:02,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:02,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:02,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:02,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:11:02,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:43 [2018-11-23 11:11:02,884 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:02,885 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_63|, v_subst_3]. (or (not (= (_ bv0 32) (bvadd (select (select (store |v_#memory_int_63| main_~t~0.base (store (select |v_#memory_int_63| main_~t~0.base) v_subst_3 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)))) (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_63| main_~p~0.base) .cse0)))) |v_#memory_int_63|))) [2018-11-23 11:11:02,885 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_26, v_DerPreprocessor_28]. (let ((.cse0 (select |#memory_int| main_~p~0.base)) (.cse1 (bvadd main_~p~0.offset (_ bv4 32)))) (and (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (or (not (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_26)) main_~a~0.base) main_~a~0.offset))) (= main_~t~0.base main_~a~0.base)))) [2018-11-23 11:11:03,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-23 11:11:03,102 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 8 treesize of output 1 [2018-11-23 11:11:03,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,109 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 21 treesize of output 19 [2018-11-23 11:11:03,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-23 11:11:03,170 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:03,171 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:03,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-23 11:11:03,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,178 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:11:03,179 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:03,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:03,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 11:11:03,274 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:39 [2018-11-23 11:11:03,282 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:03,283 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_28, v_main_~t~0.base_18]. (or (not (= (select |#valid| v_main_~t~0.base_18) (_ bv0 1))) (not (= (_ bv0 32) (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32))))) [2018-11-23 11:11:03,283 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_15, v_main_~t~0.base_18, v_prenex_16]. (let ((.cse0 (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset))) (and (or (not (= (select |#valid| v_prenex_15) (_ bv0 1))) (= main_~p~0.base main_~a~0.base)) (or (not (= (select |#valid| v_main_~t~0.base_18) (_ bv0 1))) (not .cse0)) (or (not (= (select |#valid| v_prenex_16) (_ bv0 1))) .cse0 (= main_~a~0.offset main_~p~0.offset)))) [2018-11-23 11:11:03,555 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-11-23 11:11:03,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {4087#false} assume !false; {4087#false} is VALID [2018-11-23 11:11:03,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {4087#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {4087#false} is VALID [2018-11-23 11:11:03,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {4087#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:03,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {4087#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {4087#false} is VALID [2018-11-23 11:11:03,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {4087#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:03,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {4087#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {4087#false} is VALID [2018-11-23 11:11:03,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {4087#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:03,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {4087#false} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4087#false} is VALID [2018-11-23 11:11:03,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {4087#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4087#false} is VALID [2018-11-23 11:11:03,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {4226#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4087#false} is VALID [2018-11-23 11:11:03,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {4230#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4226#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:03,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {4234#(forall ((main_~p~0.offset (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4230#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:03,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {4234#(forall ((main_~p~0.offset (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {4234#(forall ((main_~p~0.offset (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:11:03,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {4241#(forall ((v_DerPreprocessor_28 (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {4234#(forall ((main_~p~0.offset (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:11:03,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {4241#(forall ((v_DerPreprocessor_28 (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4241#(forall ((v_DerPreprocessor_28 (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:11:03,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {4248#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_16 (_ BitVec 32))) (not (= (select |#valid| v_prenex_16) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_15 (_ BitVec 32))) (not (= (select |#valid| v_prenex_15) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {4241#(forall ((v_DerPreprocessor_28 (_ BitVec 32))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_28)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:11:03,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {4248#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_16 (_ BitVec 32))) (not (= (select |#valid| v_prenex_16) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_15 (_ BitVec 32))) (not (= (select |#valid| v_prenex_15) (_ bv0 1))))))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {4248#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_16 (_ BitVec 32))) (not (= (select |#valid| v_prenex_16) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_15 (_ BitVec 32))) (not (= (select |#valid| v_prenex_15) (_ bv0 1))))))} is VALID [2018-11-23 11:11:03,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {4086#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4248#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_16 (_ BitVec 32))) (not (= (select |#valid| v_prenex_16) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_15 (_ BitVec 32))) (not (= (select |#valid| v_prenex_15) (_ bv0 1))))))} is VALID [2018-11-23 11:11:03,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {4086#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4086#true} is VALID [2018-11-23 11:11:03,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {4086#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4086#true} is VALID [2018-11-23 11:11:03,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {4086#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4086#true} is VALID [2018-11-23 11:11:03,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {4086#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {4086#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {4086#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {4086#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {4086#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {4086#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {4086#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4086#true} is VALID [2018-11-23 11:11:03,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {4086#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {4086#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {4086#true} call #t~ret39 := main(); {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4086#true} {4086#true} #200#return; {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {4086#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4086#true} is VALID [2018-11-23 11:11:03,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {4086#true} call ULTIMATE.init(); {4086#true} is VALID [2018-11-23 11:11:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:11:03,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:11:03,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:11:03,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-23 11:11:03,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:03,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:11:03,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:03,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:11:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:11:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:11:03,686 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 13 states. [2018-11-23 11:11:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:10,024 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-11-23 11:11:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:11:10,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-23 11:11:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:11:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2018-11-23 11:11:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:11:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2018-11-23 11:11:10,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2018-11-23 11:11:10,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:10,676 INFO L225 Difference]: With dead ends: 103 [2018-11-23 11:11:10,676 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:11:10,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:11:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:11:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-11-23 11:11:10,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:10,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 78 states. [2018-11-23 11:11:10,799 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 78 states. [2018-11-23 11:11:10,800 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 78 states. [2018-11-23 11:11:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:10,803 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2018-11-23 11:11:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2018-11-23 11:11:10,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:10,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:10,804 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 90 states. [2018-11-23 11:11:10,804 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 90 states. [2018-11-23 11:11:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:10,806 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2018-11-23 11:11:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2018-11-23 11:11:10,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:10,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:10,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:10,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:11:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2018-11-23 11:11:10,809 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 35 [2018-11-23 11:11:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:10,809 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2018-11-23 11:11:10,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:11:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-23 11:11:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:11:10,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:10,810 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:11:10,810 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:10,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2052338533, now seen corresponding path program 1 times [2018-11-23 11:11:10,810 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:10,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:11,012 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:11:11,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:11:11,027 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:11,028 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_55|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_55| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:11:11,028 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:11:11,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:11,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:11,086 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:11:11,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:11:11,191 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 13 treesize of output 10 [2018-11-23 11:11:11,199 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:11:11,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,251 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 13 treesize of output 10 [2018-11-23 11:11:11,259 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 10 treesize of output 9 [2018-11-23 11:11:11,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:11:11,335 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:11,335 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_61|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_64|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_61| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_61| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_64| main_~a~0.base (store (select |v_#memory_$Pointer$.base_64| main_~a~0.base) .cse0 main_~t~0.base))))) [2018-11-23 11:11:11,335 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:11:11,448 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 102 treesize of output 98 [2018-11-23 11:11:11,456 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 28 treesize of output 1 [2018-11-23 11:11:11,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,537 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 23 treesize of output 16 [2018-11-23 11:11:11,543 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 16 treesize of output 15 [2018-11-23 11:11:11,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,591 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 51 treesize of output 52 [2018-11-23 11:11:11,597 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 28 treesize of output 1 [2018-11-23 11:11:11,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,617 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:11:11,773 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:11,773 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_65|, |v_#memory_int_65|, |v_#memory_$Pointer$.offset_62|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_65| main_~p~0.base) (_ bv4 32))) (.cse1 (select (select |v_#memory_$Pointer$.offset_62| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_62| .cse0 (store (select |v_#memory_$Pointer$.offset_62| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (not (= .cse0 main_~p~0.base)) (= (store |v_#memory_$Pointer$.base_65| .cse0 (store (select |v_#memory_$Pointer$.base_65| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_65| .cse0 (store (select |v_#memory_int_65| .cse0) .cse1 (_ bv3 32))) |#memory_int|))) [2018-11-23 11:11:11,774 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:11:11,826 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 25 treesize of output 21 [2018-11-23 11:11:11,835 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:11:11,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,857 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 23 [2018-11-23 11:11:11,863 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 23 treesize of output 14 [2018-11-23 11:11:11,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,884 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:11:11,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:11:11,890 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:11,890 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_54, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_54) (_ bv4 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_54) (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967293 32))) (= main_~p~0.offset .cse1) (not (= v_main_~p~0.base_54 .cse0)))) [2018-11-23 11:11:11,890 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:11:11,919 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:11:11,924 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:11:11,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:11,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:11:11,933 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:11,933 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem34|))) [2018-11-23 11:11:11,933 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem34| (_ bv3 32)) [2018-11-23 11:11:11,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {4729#true} call ULTIMATE.init(); {4729#true} is VALID [2018-11-23 11:11:11,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {4729#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4729#true} is VALID [2018-11-23 11:11:11,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {4729#true} assume true; {4729#true} is VALID [2018-11-23 11:11:11,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4729#true} {4729#true} #200#return; {4729#true} is VALID [2018-11-23 11:11:11,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {4729#true} call #t~ret39 := main(); {4729#true} is VALID [2018-11-23 11:11:11,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {4729#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4729#true} is VALID [2018-11-23 11:11:11,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {4729#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {4729#true} is VALID [2018-11-23 11:11:11,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {4729#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {4729#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {4729#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {4729#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {4729#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {4729#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4729#true} is VALID [2018-11-23 11:11:11,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {4729#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4729#true} is VALID [2018-11-23 11:11:11,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {4729#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4729#true} is VALID [2018-11-23 11:11:11,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {4729#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4779#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:11,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {4779#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4779#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:11,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {4779#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4786#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:11,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {4786#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet28);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {4790#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:11,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {4790#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4790#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:11,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {4790#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:11:11,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:11:11,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:11:11,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {4797#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4807#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:11:11,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {4807#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4807#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:11:11,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {4807#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4814#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:11:11,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {4814#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4818#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {4818#(= (bvadd |main_#t~mem34| (_ bv4294967293 32)) (_ bv0 32))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4730#false} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {4730#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {4730#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {4730#false} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {4730#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {4730#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {4730#false} is VALID [2018-11-23 11:11:11,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {4730#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:11,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {4730#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {4730#false} is VALID [2018-11-23 11:11:11,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {4730#false} assume !false; {4730#false} is VALID [2018-11-23 11:11:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:11:11,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:12,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,298 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,453 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:11:12,475 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:11:12,492 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:12,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-11-23 11:11:12,607 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 22 treesize of output 1 [2018-11-23 11:11:12,608 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,615 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,621 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 56 treesize of output 40 [2018-11-23 11:11:12,631 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 22 treesize of output 1 [2018-11-23 11:11:12,632 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,640 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:11:12,661 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-11-23 11:11:13,091 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:13,092 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_66|, |v_#memory_$Pointer$.offset_63|]. (or (not (= (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_63| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.offset_63|)) (not (= |v_#memory_$Pointer$.base_66| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_66| main_~p~0.base) main_~p~0.offset))))) (not (= (_ bv1 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_66| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_63| main_~a~0.base) .cse0)))))) [2018-11-23 11:11:13,092 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_34, v_DerPreprocessor_30]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) .cse0)) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) .cse0) main_~p~0.base))) [2018-11-23 11:11:13,282 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 37 treesize of output 29 [2018-11-23 11:11:13,362 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 11 treesize of output 10 [2018-11-23 11:11:13,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,451 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 20 treesize of output 24 [2018-11-23 11:11:13,462 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 11 [2018-11-23 11:11:13,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:11:13,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:11:13,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:13,556 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 21 treesize of output 19 [2018-11-23 11:11:13,572 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 8 treesize of output 1 [2018-11-23 11:11:13,573 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:11:13,799 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 37 treesize of output 29 [2018-11-23 11:11:13,867 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 11 treesize of output 10 [2018-11-23 11:11:13,868 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,925 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 21 treesize of output 19 [2018-11-23 11:11:13,933 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 8 treesize of output 1 [2018-11-23 11:11:13,934 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,942 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,969 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 20 treesize of output 24 [2018-11-23 11:11:13,981 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 11 [2018-11-23 11:11:13,983 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:14,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:11:14,022 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:14,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:11:14,055 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:14,068 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:14,152 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:11:14,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:11:14,307 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:11:14,338 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:14,338 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_main_~p~0.offset_58, v_DerPreprocessor_30, |#memory_$Pointer$.offset|, v_prenex_17, v_DerPreprocessor_34]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_main_~p~0.offset_58 v_DerPreprocessor_30))) main_~a~0.base) .cse2)) (= v_prenex_17 (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 v_prenex_17)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) v_prenex_17 v_DerPreprocessor_34))) main_~a~0.base) .cse2)))) [2018-11-23 11:11:14,339 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:11:14,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {4730#false} assume !false; {4730#false} is VALID [2018-11-23 11:11:14,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {4730#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {4730#false} is VALID [2018-11-23 11:11:14,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {4730#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:14,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {4730#false} assume !(2bv32 == #t~mem36);havoc #t~mem36; {4730#false} is VALID [2018-11-23 11:11:14,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {4730#false} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:14,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {4730#false} assume !(1bv32 == #t~mem34);havoc #t~mem34; {4730#false} is VALID [2018-11-23 11:11:14,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {4730#false} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4730#false} is VALID [2018-11-23 11:11:14,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {4864#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4730#false} is VALID [2018-11-23 11:11:14,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {4868#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4864#(not (= (bvadd |main_#t~mem34| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:14,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {4872#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(1bv32 == #t~mem34);havoc #t~mem34;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4868#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:14,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {4872#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {4872#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:14,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4872#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:14,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:11:14,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:11:14,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {4889#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {4879#(and (forall ((v_DerPreprocessor_30 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_30)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_34 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:11:14,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {4889#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {4889#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:14,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {4896#(and (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc29.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc29.base_3|) (_ bv0 1))))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_20 (_ BitVec 32))) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet28);havoc #t~nondet28;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc29.base, #t~malloc29.offset; {4889#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:14,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {4900#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4896#(and (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc29.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc29.base_3|) (_ bv0 1))))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_20 (_ BitVec 32))) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))))} is VALID [2018-11-23 11:11:14,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {4900#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {4900#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:11:14,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {4729#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {4900#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {4729#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {4729#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {4729#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {4729#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {4729#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {4729#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {4729#true} is VALID [2018-11-23 11:11:14,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {4729#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {4729#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {4729#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {4729#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {4729#true} call #t~ret39 := main(); {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4729#true} {4729#true} #200#return; {4729#true} is VALID [2018-11-23 11:11:14,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {4729#true} assume true; {4729#true} is VALID [2018-11-23 11:11:14,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {4729#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4729#true} is VALID [2018-11-23 11:11:14,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {4729#true} call ULTIMATE.init(); {4729#true} is VALID [2018-11-23 11:11:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:11:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:11:14,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:11:14,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 11:11:14,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:14,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:11:14,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:14,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:11:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:11:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:11:14,968 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2018-11-23 11:11:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:21,575 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2018-11-23 11:11:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:11:21,575 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 11:11:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-23 11:11:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-23 11:11:21,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2018-11-23 11:11:21,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:21,741 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:11:21,741 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:11:21,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:11:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:11:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-23 11:11:21,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:21,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 75 states. [2018-11-23 11:11:21,805 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 75 states. [2018-11-23 11:11:21,806 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 75 states. [2018-11-23 11:11:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:21,808 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2018-11-23 11:11:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2018-11-23 11:11:21,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:21,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:21,809 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 79 states. [2018-11-23 11:11:21,809 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 79 states. [2018-11-23 11:11:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:21,810 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2018-11-23 11:11:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2018-11-23 11:11:21,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:21,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:21,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:21,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:11:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2018-11-23 11:11:21,813 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 35 [2018-11-23 11:11:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2018-11-23 11:11:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:11:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2018-11-23 11:11:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:11:21,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:21,814 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] [2018-11-23 11:11:21,815 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:21,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1260409452, now seen corresponding path program 3 times [2018-11-23 11:11:21,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:21,843 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:11:22,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:11:22,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:11:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:22,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:22,297 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:11:22,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:11:22,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:22,308 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_62|]. (and (= (store |v_#valid_62| main_~a~0.base (_ bv1 1)) |#valid|) (= main_~a~0.offset (_ bv0 32))) [2018-11-23 11:11:22,308 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:11:22,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:22,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:22,368 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 19 treesize of output 23 [2018-11-23 11:11:22,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2018-11-23 11:11:22,402 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:22,403 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_63|]. (and (= (bvadd (select |v_#valid_63| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (store |v_#valid_63| main_~t~0.base (_ bv1 1)) |#valid|) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (select |v_#valid_63| main_~t~0.base) (_ bv0 1))) [2018-11-23 11:11:22,403 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:11:22,476 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 13 treesize of output 10 [2018-11-23 11:11:22,483 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 10 treesize of output 9 [2018-11-23 11:11:22,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,541 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 13 treesize of output 10 [2018-11-23 11:11:22,547 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:11:22,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:22,586 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:11:22,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:61 [2018-11-23 11:11:22,755 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:22,755 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_69|, main_~t~0.base, |v_#memory_$Pointer$.offset_66|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_69| main_~a~0.base (store (select |v_#memory_$Pointer$.base_69| main_~a~0.base) .cse0 main_~t~0.base))) (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_66| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_66| main_~a~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-11-23 11:11:22,756 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset .cse1) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-11-23 11:11:22,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:22,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:22,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:22,863 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 26 treesize of output 25 [2018-11-23 11:11:22,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:23,096 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-23 11:11:23,112 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 18 treesize of output 23 [2018-11-23 11:11:23,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,242 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 14 [2018-11-23 11:11:23,253 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 14 treesize of output 19 [2018-11-23 11:11:23,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:23,358 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-11-23 11:11:23,369 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 17 [2018-11-23 11:11:23,371 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,393 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,441 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:110, output treesize:77 [2018-11-23 11:11:23,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:23,528 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_70|, |v_#valid_64|, |v_#memory_$Pointer$.offset_67|, |v_#memory_int_69|]. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_67| main_~a~0.base) .cse2)) (.cse0 (select (select |v_#memory_$Pointer$.base_70| main_~a~0.base) .cse2))) (and (= (_ bv0 1) (bvadd (select |v_#valid_64| .cse0) (_ bv1 1))) (= main_~p~0.offset .cse1) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) .cse1) (not (= .cse0 main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_67| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_67| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= main_~t~0.offset (_ bv0 32)) (= (select |v_#valid_64| main_~t~0.base) (_ bv0 1)) (= (store |v_#memory_$Pointer$.base_70| main_~p~0.base (store (select |v_#memory_$Pointer$.base_70| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_69| main_~p~0.base (store (select |v_#memory_int_69| main_~p~0.base) main_~p~0.offset (_ bv2 32)))) (= (bvadd (select |v_#valid_64| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= .cse0 main_~p~0.base)))) [2018-11-23 11:11:23,528 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (not (= .cse0 main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= (_ bv0 32) .cse1) (= .cse0 main_~p~0.base) (= main_~p~0.offset .cse1) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| .cse0) .cse1))))) [2018-11-23 11:11:23,690 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 183 [2018-11-23 11:11:23,700 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 22 treesize of output 21 [2018-11-23 11:11:23,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:23,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:23,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 194 [2018-11-23 11:11:23,952 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 40 treesize of output 36 [2018-11-23 11:11:23,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,114 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 69 treesize of output 52 [2018-11-23 11:11:24,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,134 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 52 treesize of output 38 [2018-11-23 11:11:24,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,203 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:145 [2018-11-23 11:11:24,261 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:24,262 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_68|, |v_#memory_int_70|, main_~t~0.base]. (let ((.cse4 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_68| main_~a~0.base) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.base_71| main_~a~0.base) .cse4))) (let ((.cse2 (select |v_#memory_int_70| .cse0)) (.cse1 (bvadd .cse3 (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) main_~p~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (_ bv2 32) (select .cse2 .cse3)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.base_71| .cse0 (store (select |v_#memory_$Pointer$.base_71| .cse0) .cse1 main_~t~0.base)) |#memory_$Pointer$.base|) (not (= main_~t~0.base .cse0)) (= (store |v_#memory_$Pointer$.offset_68| .cse0 (store (select |v_#memory_$Pointer$.offset_68| .cse0) .cse1 (_ bv0 32))) |#memory_$Pointer$.offset|) (not (= main_~a~0.base .cse0)) (= (store |v_#memory_int_70| .cse0 (store .cse2 .cse1 (select (select |#memory_int| .cse0) .cse1))) |#memory_int|) (= .cse3 (_ bv0 32)))))) [2018-11-23 11:11:24,262 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse5))) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse5)) (.cse4 (bvadd .cse1 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse3) .cse4)) (.cse2 (select (select |#memory_$Pointer$.base| .cse3) .cse4))) (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= main_~p~0.base .cse2) (= main_~p~0.offset .cse0) (not (= .cse3 .cse2)) (= (_ bv2 32) (select (select |#memory_int| .cse3) .cse1)) (not (= main_~a~0.base .cse2))))))) [2018-11-23 11:11:24,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 269 [2018-11-23 11:11:24,498 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 68 treesize of output 1 [2018-11-23 11:11:24,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 101 [2018-11-23 11:11:24,682 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 64 treesize of output 62 [2018-11-23 11:11:24,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:24,797 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 178 treesize of output 194 [2018-11-23 11:11:24,806 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 68 treesize of output 1 [2018-11-23 11:11:24,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,837 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:24,864 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:306, output treesize:96 [2018-11-23 11:11:27,368 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:27,369 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_72|, |v_#memory_$Pointer$.offset_69|, |v_#memory_int_71|]. (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_69| main_~p~0.base) (_ bv4 32)))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_72| main_~p~0.base) (_ bv4 32))) (.cse4 (bvadd .cse3 (_ bv4 32)))) (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_69| .cse2) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.base_72| .cse2) .cse4))) (and (= main_~p~0.offset (_ bv0 32)) (not (= .cse0 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_71| .cse0 (store (select |v_#memory_int_71| .cse0) .cse1 (_ bv3 32)))) (= (store |v_#memory_$Pointer$.offset_69| .cse0 (store (select |v_#memory_$Pointer$.offset_69| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_72| .cse0 (store (select |v_#memory_$Pointer$.base_72| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (_ bv0 32) .cse1) (= (select (select |v_#memory_int_71| .cse2) .cse3) (_ bv2 32)) (= .cse3 (_ bv0 32)) (not (= .cse2 .cse0)))))) [2018-11-23 11:11:27,369 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (.cse4 (bvadd .cse2 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse3) .cse4)) (.cse1 (select (select |#memory_$Pointer$.base| .cse3) .cse4))) (and (= (_ bv0 32) .cse0) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse1) .cse0) (_ bv3 32)) (= .cse2 (_ bv0 32)) (= (select (select |#memory_int| .cse3) .cse2) (_ bv2 32)) (not (= main_~p~0.base .cse1)))))) [2018-11-23 11:11:27,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 86 [2018-11-23 11:11:27,639 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 78 treesize of output 61 [2018-11-23 11:11:27,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:27,682 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 31 treesize of output 19 [2018-11-23 11:11:27,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:27,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:27,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-11-23 11:11:27,778 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:11:27,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:11:27,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:11:27,813 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:11:27,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:27,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:27,846 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:33 [2018-11-23 11:11:27,872 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:27,872 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_63, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_63) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_63) (_ bv4 32))) (.cse4 (bvadd .cse1 (_ bv4 32)))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) .cse4)) (.cse3 (select (select |#memory_$Pointer$.offset| .cse0) .cse4))) (and (= (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967294 32)) (_ bv0 32)) (not (= v_main_~p~0.base_63 .cse2)) (= .cse1 main_~p~0.offset) (= (_ bv0 32) .cse3) (= .cse1 (_ bv0 32)) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse2) .cse3) (_ bv4294967293 32))) (= .cse0 main_~p~0.base) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_63) (_ bv0 32))))))) [2018-11-23 11:11:27,873 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_63, v_arrayElimCell_119]. (and (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32))) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_63 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_63) (_ bv0 32))) (= (bvadd (select (select |#memory_int| v_arrayElimCell_119) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))) [2018-11-23 11:11:27,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:27,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-11-23 11:11:27,998 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-23 11:11:28,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:28,028 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 7 treesize of output 1 [2018-11-23 11:11:28,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:28,047 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 13 treesize of output 5 [2018-11-23 11:11:28,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:28,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:28,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:28,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2018-11-23 11:11:28,079 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:28,079 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_63, v_arrayElimCell_119]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (not (= v_main_~p~0.base_63 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_63) (_ bv0 32))) (= |main_#t~mem36| .cse0) (= (bvadd (select (select |#memory_int| v_arrayElimCell_119) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))) [2018-11-23 11:11:28,079 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:11:28,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {5332#true} call ULTIMATE.init(); {5332#true} is VALID [2018-11-23 11:11:28,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {5332#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5332#true} is VALID [2018-11-23 11:11:28,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {5332#true} assume true; {5332#true} is VALID [2018-11-23 11:11:28,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5332#true} {5332#true} #200#return; {5332#true} is VALID [2018-11-23 11:11:28,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {5332#true} call #t~ret39 := main(); {5332#true} is VALID [2018-11-23 11:11:28,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {5332#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~root~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~root~0.base, ~bvadd32(4bv32, ~root~0.offset), 4bv32); {5332#true} is VALID [2018-11-23 11:11:28,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {5332#true} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {5332#true} is VALID [2018-11-23 11:11:28,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {5332#true} ~n~0.base, ~n~0.offset := 0bv32, 0bv32;havoc ~pred~0.base, ~pred~0.offset; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {5332#true} assume !!(~root~0.base != 0bv32 || ~root~0.offset != 0bv32);~pred~0.base, ~pred~0.offset := 0bv32, 0bv32;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {5332#true} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4bv32);#t~short22 := #t~mem20.base != 0bv32 || #t~mem20.offset != 0bv32; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {5332#true} assume !#t~short22;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);#t~short22 := #t~mem21.base != 0bv32 || #t~mem21.offset != 0bv32; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {5332#true} assume !#t~short22;havoc #t~short22;havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {5332#true} assume !(~pred~0.base != 0bv32 || ~pred~0.offset != 0bv32);~root~0.base, ~root~0.offset := 0bv32, 0bv32; {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {5332#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5332#true} is VALID [2018-11-23 11:11:28,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {5332#true} assume !(~root~0.base != 0bv32 || ~root~0.offset != 0bv32); {5332#true} is VALID [2018-11-23 11:11:28,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {5332#true} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc27.base, #t~malloc27.offset; {5382#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:28,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {5382#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {5382#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:28,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {5382#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5389#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:28,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {5389#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet28);havoc #t~nondet28; {5389#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:28,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {5389#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {5396#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:28,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {5396#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:28,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {5403#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:28,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {5403#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!(0bv32 != #t~nondet31);havoc #t~nondet31;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {5407#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {5407#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {5407#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {5407#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {5414#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {5414#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {5414#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {5414#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} call #t~mem34 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !(1bv32 == #t~mem34);havoc #t~mem34; {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {5421#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5431#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:11:28,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {5431#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !!(2bv32 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {5435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_arrayElimCell_119 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_arrayElimCell_119) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))) (exists ((v_main_~p~0.base_63 (_ BitVec 32))) (and (not (= v_main_~p~0.base_63 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_63) (_ bv0 32))))))} is VALID [2018-11-23 11:11:28,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_arrayElimCell_119 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_arrayElimCell_119) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32))) (exists ((v_main_~p~0.base_63 (_ BitVec 32))) (and (not (= v_main_~p~0.base_63 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_63) (_ bv0 32))))))} call #t~mem36 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5439#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:28,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {5439#(= (bvadd |main_#t~mem36| (_ bv4294967294 32)) (_ bv0 32))} assume !(2bv32 == #t~mem36);havoc #t~mem36; {5333#false} is VALID [2018-11-23 11:11:28,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {5333#false} call #t~mem38 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {5333#false} is VALID [2018-11-23 11:11:28,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {5333#false} assume 3bv32 != #t~mem38;havoc #t~mem38; {5333#false} is VALID [2018-11-23 11:11:28,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {5333#false} assume !false; {5333#false} is VALID [2018-11-23 11:11:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:11:28,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:28,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:28,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:28,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:28,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:28,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:28,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:62 [2018-11-23 11:11:28,782 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:28,783 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_73|, |v_#memory_$Pointer$.offset_70|]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (not (= (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_70| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.offset_70|)) (not (= (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_73| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.base_73|)) (= (_ bv2 32) (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select |v_#memory_$Pointer$.base_73| main_~a~0.base) .cse1)) (select (select |v_#memory_$Pointer$.offset_70| main_~a~0.base) .cse1)))) (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:11:28,783 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_38, v_DerPreprocessor_40]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_38)) main_~a~0.base) .cse1)) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_40)) main_~a~0.base) .cse1)))))) [2018-11-23 11:11:29,249 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:11:29,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:29,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:29,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:29,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:29,593 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:11:29,676 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:11:29,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:30,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:30,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-23 11:11:30,800 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:120, output treesize:419 [2018-11-23 11:11:33,293 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:33,293 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_DerPreprocessor_38, |v_#memory_int_73|, v_DerPreprocessor_40]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (store |v_#memory_int_73| main_~t~0.base (store (select |v_#memory_int_73| main_~t~0.base) main_~t~0.offset (_ bv3 32))))) (or (not (= |v_#memory_int_73| (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_73| main_~p~0.base) .cse0))))) (= (_ bv2 32) (let ((.cse3 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse1 (select (select (let ((.cse2 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse0 main_~t~0.base)))) (store .cse2 main_~t~0.base (store (select .cse2 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_38))) main_~a~0.base) .cse3)) (select (select (let ((.cse4 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0 main_~t~0.offset)))) (store .cse4 main_~t~0.base (store (select .cse4 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_40))) main_~a~0.base) .cse3)))) (not (= (_ bv2 32) (select (select .cse1 main_~a~0.base) main_~a~0.offset))))) [2018-11-23 11:11:33,294 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_24, v_DerPreprocessor_46, v_prenex_23, v_prenex_25, v_DerPreprocessor_48, v_prenex_26, v_DerPreprocessor_40, v_DerPreprocessor_42, v_DerPreprocessor_38, v_prenex_22, v_DerPreprocessor_44, v_prenex_21]. (let ((.cse8 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse5 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse8 main_~t~0.offset))) (.cse2 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse8 main_~t~0.base)))) (let ((.cse1 (= main_~t~0.base main_~a~0.base)) (.cse9 (= main_~a~0.offset main_~t~0.offset)) (.cse3 (select .cse2 main_~t~0.base)) (.cse6 (select .cse5 main_~t~0.base)) (.cse4 (bvadd main_~a~0.offset (_ bv4 32))) (.cse7 (select |#memory_int| main_~p~0.base))) (and (let ((.cse0 (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_46)))) (or (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) .cse1 (= (_ bv2 32) (select (select .cse0 (select (select (store .cse2 main_~t~0.base (store .cse3 main_~t~0.offset v_prenex_24)) main_~a~0.base) .cse4)) (select (select (store .cse5 main_~t~0.base (store .cse6 main_~t~0.offset v_prenex_23)) main_~a~0.base) .cse4))))) (or .cse9 (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_48)) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select (store .cse5 main_~t~0.base (store .cse6 main_~t~0.offset v_prenex_25)) main_~a~0.base) .cse4) main_~t~0.offset)) (not (= main_~t~0.base (select (select (store .cse2 main_~t~0.base (store .cse3 main_~t~0.offset v_prenex_26)) main_~a~0.base) .cse4)))) (or (not (= (select (select (store .cse5 main_~t~0.base (store .cse6 main_~t~0.offset v_DerPreprocessor_40)) main_~a~0.base) .cse4) main_~t~0.offset)) .cse1 (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_42)) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) (not (= main_~t~0.base (select (select (store .cse2 main_~t~0.base (store .cse3 main_~t~0.offset v_DerPreprocessor_38)) main_~a~0.base) .cse4)))) (let ((.cse10 (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_44)))) (or .cse9 (= (_ bv2 32) (select (select .cse10 (select (select (store .cse2 main_~t~0.base (store .cse3 main_~t~0.offset v_prenex_22)) main_~a~0.base) .cse4)) (select (select (store .cse5 main_~t~0.base (store .cse6 main_~t~0.offset v_prenex_21)) main_~a~0.base) .cse4))) (not (= (bvadd (select (select .cse10 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))))))))) [2018-11-23 11:11:34,325 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-23 11:11:50,615 WARN L180 SmtUtils]: Spent 15.12 s on a formula simplification that was a NOOP. DAG size: 251 [2018-11-23 11:11:50,846 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:50,847 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:11:50,852 INFO L168 Benchmark]: Toolchain (without parser) took 104229.84 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -357.2 MB). Peak memory consumption was 737.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:11:50,853 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:11:50,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:11:50,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:11:50,854 INFO L168 Benchmark]: Boogie Preprocessor took 68.90 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:11:50,854 INFO L168 Benchmark]: RCFGBuilder took 1904.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:11:50,854 INFO L168 Benchmark]: TraceAbstraction took 101432.57 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 373.2 MB). Peak memory consumption was 720.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:11:50,856 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.90 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1904.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101432.57 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 373.2 MB). Peak memory consumption was 720.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...