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/heap-data/cart_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:19:28,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:19:28,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:19:28,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:19:28,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:19:28,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:19:28,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:19:28,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:19:28,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:19:28,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:19:28,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:19:28,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:19:28,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:19:28,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:19:28,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:19:28,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:19:28,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:19:28,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:19:28,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:19:28,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:19:28,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:19:28,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:19:28,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:19:28,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:19:28,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:19:28,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:19:28,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:19:28,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:19:28,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:19:28,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:19:28,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:19:28,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:19:28,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:19:28,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:19:28,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:19:28,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:19:28,081 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:19:28,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:19:28,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:19:28,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:19:28,098 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:19:28,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:19:28,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:19:28,101 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:19:28,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:19:28,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:19:28,103 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:19:28,103 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:19:28,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:19:28,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:19:28,103 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:19:28,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:19:28,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:19:28,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:19:28,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:19:28,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:19:28,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:19:28,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:19:28,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:19:28,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:19:28,108 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:19:28,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:19:28,108 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:19:28,108 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:19:28,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:19:28,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:19:28,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:19:28,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:19:28,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:19:28,183 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:19:28,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/cart_true-unreach-call.i [2018-11-23 11:19:28,249 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb309c419/96933b47ced147b9967f3eae941c4b6e/FLAG426f2ef99 [2018-11-23 11:19:28,736 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:19:28,738 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart_true-unreach-call.i [2018-11-23 11:19:28,761 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb309c419/96933b47ced147b9967f3eae941c4b6e/FLAG426f2ef99 [2018-11-23 11:19:29,035 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb309c419/96933b47ced147b9967f3eae941c4b6e [2018-11-23 11:19:29,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:19:29,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:19:29,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:29,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:19:29,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:19:29,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:29,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29, skipping insertion in model container [2018-11-23 11:19:29,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:29,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:19:29,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:19:29,639 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:29,658 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:19:29,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:29,898 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:19:29,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29 WrapperNode [2018-11-23 11:19:29,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:29,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:29,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:19:29,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:19:29,910 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:19:29" (1/1) ... [2018-11-23 11:19:29,949 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:19:29" (1/1) ... [2018-11-23 11:19:29,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:29,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:19:29,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:19:29,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:19:29,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:29,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:29,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:29,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:30,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:30,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:30,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (1/1) ... [2018-11-23 11:19:30,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:19:30,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:19:30,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:19:30,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:19:30,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (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:19:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:19:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:19:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:19:30,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:19:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:19:30,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:19:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:19:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:19:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:19:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:19:30,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:19:31,158 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:19:31,159 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:19:31,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:31 BoogieIcfgContainer [2018-11-23 11:19:31,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:19:31,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:19:31,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:19:31,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:19:31,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:19:29" (1/3) ... [2018-11-23 11:19:31,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429c9599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:31, skipping insertion in model container [2018-11-23 11:19:31,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:29" (2/3) ... [2018-11-23 11:19:31,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429c9599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:31, skipping insertion in model container [2018-11-23 11:19:31,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:31" (3/3) ... [2018-11-23 11:19:31,169 INFO L112 eAbstractionObserver]: Analyzing ICFG cart_true-unreach-call.i [2018-11-23 11:19:31,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:19:31,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:19:31,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:19:31,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:19:31,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:19:31,247 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:19:31,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:19:31,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:19:31,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:19:31,248 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:19:31,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:19:31,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:19:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:19:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:19:31,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:31,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:31,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:31,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1437833417, now seen corresponding path program 1 times [2018-11-23 11:19:31,293 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:31,294 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:19:31,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:31,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:31,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:19:31,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:19:31,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:19:31,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2018-11-23 11:19:31,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret13 := main(); {27#true} is VALID [2018-11-23 11:19:31,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {27#true} is VALID [2018-11-23 11:19:31,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 11:19:31,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {28#false} is VALID [2018-11-23 11:19:31,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2018-11-23 11:19:31,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {28#false} is VALID [2018-11-23 11:19:31,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {28#false} is VALID [2018-11-23 11:19:31,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {28#false} is VALID [2018-11-23 11:19:31,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:19:31,547 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:19:31,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:19:31,561 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:19:31,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:31,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:19:31,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:31,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:19:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:19:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:19:31,677 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 11:19:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:32,045 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2018-11-23 11:19:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:19:32,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:19:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:19:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:19:32,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 11:19:32,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:32,331 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:19:32,331 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:19:32,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:19:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:19:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:19:32,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:32,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:19:32,470 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:19:32,470 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:19:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:32,474 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-11-23 11:19:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-11-23 11:19:32,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:32,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:32,476 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:19:32,476 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:19:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:32,480 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-11-23 11:19:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-11-23 11:19:32,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:32,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:32,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:32,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:19:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 11:19:32,486 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2018-11-23 11:19:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:32,487 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 11:19:32,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:19:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-11-23 11:19:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:19:32,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:32,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:32,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:32,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash 797929635, now seen corresponding path program 1 times [2018-11-23 11:19:32,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:32,490 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:19:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:32,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:32,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {187#true} is VALID [2018-11-23 11:19:32,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {187#true} is VALID [2018-11-23 11:19:32,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2018-11-23 11:19:32,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #71#return; {187#true} is VALID [2018-11-23 11:19:32,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret13 := main(); {187#true} is VALID [2018-11-23 11:19:32,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:32,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {226#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:32,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {188#false} is VALID [2018-11-23 11:19:32,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {188#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {188#false} is VALID [2018-11-23 11:19:32,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {188#false} assume !false; {188#false} is VALID [2018-11-23 11:19:32,964 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:19:32,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:32,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:32,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:19:32,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:32,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:33,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:33,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:33,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:33,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:33,079 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 4 states. [2018-11-23 11:19:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:34,548 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:19:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:19:34,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:19:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 11:19:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 11:19:34,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2018-11-23 11:19:34,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:34,648 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:19:34,648 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:19:34,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:19:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:19:34,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:34,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:19:34,696 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:19:34,696 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:19:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:34,699 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-23 11:19:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-23 11:19:34,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:34,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:34,700 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:19:34,700 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:19:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:34,703 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-23 11:19:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-23 11:19:34,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:34,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:34,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:34,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:19:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-23 11:19:34,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2018-11-23 11:19:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:34,707 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 11:19:34,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-23 11:19:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:19:34,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:34,708 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:34,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:34,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 445874897, now seen corresponding path program 1 times [2018-11-23 11:19:34,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:34,710 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:19:34,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:34,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:34,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-23 11:19:34,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {372#true} is VALID [2018-11-23 11:19:34,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-23 11:19:34,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {372#true} {372#true} #71#return; {372#true} is VALID [2018-11-23 11:19:34,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {372#true} call #t~ret13 := main(); {372#true} is VALID [2018-11-23 11:19:34,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {372#true} is VALID [2018-11-23 11:19:34,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#true} goto; {372#true} is VALID [2018-11-23 11:19:34,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {372#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {372#true} is VALID [2018-11-23 11:19:34,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {372#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {401#(not (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:34,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {401#(not (= (_ bv0 32) main_~l~0.base))} goto; {401#(not (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:34,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {401#(not (= (_ bv0 32) main_~l~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {401#(not (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:34,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {401#(not (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {411#(not (= (_ bv0 32) main_~i~0.base))} is VALID [2018-11-23 11:19:34,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {411#(not (= (_ bv0 32) main_~i~0.base))} goto; {411#(not (= (_ bv0 32) main_~i~0.base))} is VALID [2018-11-23 11:19:34,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#(not (= (_ bv0 32) main_~i~0.base))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {373#false} is VALID [2018-11-23 11:19:34,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {373#false} is VALID [2018-11-23 11:19:34,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {373#false} is VALID [2018-11-23 11:19:34,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {373#false} is VALID [2018-11-23 11:19:34,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-23 11:19:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:34,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:34,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:34,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:34,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:19:34,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:34,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:34,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:34,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:34,910 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2018-11-23 11:19:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:35,903 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 11:19:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:19:35,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:19:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:19:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:19:35,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-23 11:19:35,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:35,986 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:19:35,986 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:19:35,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:19:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 11:19:36,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:36,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 11:19:36,012 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 11:19:36,012 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 11:19:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:36,015 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 11:19:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 11:19:36,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:36,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 11:19:36,016 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 11:19:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:36,019 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 11:19:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 11:19:36,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:36,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:36,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:36,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:19:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 11:19:36,023 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-23 11:19:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:36,023 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 11:19:36,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 11:19:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:19:36,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:36,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:36,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:36,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 782357918, now seen corresponding path program 1 times [2018-11-23 11:19:36,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:36,026 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:19:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:36,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:36,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2018-11-23 11:19:36,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {588#true} is VALID [2018-11-23 11:19:36,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2018-11-23 11:19:36,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #71#return; {588#true} is VALID [2018-11-23 11:19:36,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret13 := main(); {588#true} is VALID [2018-11-23 11:19:36,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {588#true} is VALID [2018-11-23 11:19:36,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {588#true} goto; {588#true} is VALID [2018-11-23 11:19:36,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {588#true} is VALID [2018-11-23 11:19:36,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {588#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {588#true} is VALID [2018-11-23 11:19:36,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {588#true} goto; {588#true} is VALID [2018-11-23 11:19:36,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {588#true} is VALID [2018-11-23 11:19:36,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {588#true} is VALID [2018-11-23 11:19:36,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#true} goto; {588#true} is VALID [2018-11-23 11:19:36,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {588#true} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {588#true} is VALID [2018-11-23 11:19:36,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#true} assume #t~short7; {635#|main_#t~short7|} is VALID [2018-11-23 11:19:36,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#|main_#t~short7|} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {589#false} is VALID [2018-11-23 11:19:36,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#false} goto; {589#false} is VALID [2018-11-23 11:19:36,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {589#false} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {589#false} is VALID [2018-11-23 11:19:36,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {589#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {589#false} is VALID [2018-11-23 11:19:36,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {589#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {589#false} is VALID [2018-11-23 11:19:36,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {589#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {589#false} is VALID [2018-11-23 11:19:36,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {589#false} assume !false; {589#false} is VALID [2018-11-23 11:19:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:36,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:36,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:36,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:19:36,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:19:36,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:36,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:19:36,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:36,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:19:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:19:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:19:36,364 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 3 states. [2018-11-23 11:19:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:36,943 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-23 11:19:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:19:36,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:19:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 11:19:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 11:19:36,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-23 11:19:37,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:37,014 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:19:37,014 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:19:37,015 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:19:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:19:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:19:37,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:37,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:19:37,094 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:19:37,095 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:19:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:37,097 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 11:19:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:19:37,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:37,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:37,098 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:19:37,098 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:19:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:37,101 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 11:19:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:19:37,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:37,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:37,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:37,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:19:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 11:19:37,104 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2018-11-23 11:19:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:37,105 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 11:19:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:19:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:19:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:19:37,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:37,106 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:37,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:37,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash -26988708, now seen corresponding path program 1 times [2018-11-23 11:19:37,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:37,108 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:19:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:37,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:37,336 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 25 treesize of output 22 [2018-11-23 11:19:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:37,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:37,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-11-23 11:19:37,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:37,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:37,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:37,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:37,546 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:19:37,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:13 [2018-11-23 11:19:37,562 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:37,562 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~stock~0]. (and (= (store |v_#memory_int_12| main_~l~0.base (store (store (store (select |v_#memory_int_12| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) main_~stock~0) (bvadd main_~l~0.offset (_ bv8 32)) (_ bv0 32)) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (= (_ bv0 32) main_~l~0.offset)) [2018-11-23 11:19:37,563 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))) [2018-11-23 11:19:37,914 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 49 treesize of output 40 [2018-11-23 11:19:37,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-23 11:19:37,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:37,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:19:38,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,046 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:19:38,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2018-11-23 11:19:38,072 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:38,073 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~order~0]. (let ((.cse1 (bvadd main_~l~0.offset (_ bv8 32))) (.cse0 (select |v_#memory_int_13| main_~l~0.base)) (.cse3 (bvadd main_~l~0.offset (_ bv4 32)))) (and (= (select .cse0 .cse1) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (= (store |v_#memory_int_13| main_~l~0.base (let ((.cse2 (store .cse0 .cse1 main_~order~0))) (store .cse2 .cse3 (select .cse2 .cse3)))) |#memory_int|) (not (bvslt (select .cse0 .cse3) main_~order~0)))) [2018-11-23 11:19:38,073 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~l~0.base))) (let ((.cse1 (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (and (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (= (_ bv0 32) main_~l~0.offset) (not (bvslt .cse1 (_ bv0 32)))))) [2018-11-23 11:19:38,167 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 35 treesize of output 25 [2018-11-23 11:19:38,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-11-23 11:19:38,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,197 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:19:38,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2018-11-23 11:19:38,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:38,208 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse2 (select |#memory_int| main_~i~0.base))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv8 32)))) (and (not (bvslt .cse0 .cse1)) (not (bvslt .cse1 (_ bv0 32))) (= .cse0 |main_#t~mem11|) (= |main_#t~mem10| .cse1)))) [2018-11-23 11:19:38,208 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32)))) [2018-11-23 11:19:38,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2018-11-23 11:19:38,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {811#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {811#true} is VALID [2018-11-23 11:19:38,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2018-11-23 11:19:38,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #71#return; {811#true} is VALID [2018-11-23 11:19:38,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret13 := main(); {811#true} is VALID [2018-11-23 11:19:38,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {811#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {811#true} is VALID [2018-11-23 11:19:38,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#true} goto; {811#true} is VALID [2018-11-23 11:19:38,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {811#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {811#true} is VALID [2018-11-23 11:19:38,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} goto; {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {850#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {850#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} goto; {850#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {850#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {857#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {857#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {861#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:19:38,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {861#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:19:38,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} goto; {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:19:38,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:19:38,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {875#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv8 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:38,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {875#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv8 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {879#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} is VALID [2018-11-23 11:19:38,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {879#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {812#false} is VALID [2018-11-23 11:19:38,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {812#false} assume !false; {812#false} is VALID [2018-11-23 11:19:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:38,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:40,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {812#false} assume !false; {812#false} is VALID [2018-11-23 11:19:40,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {889#(not (bvsgt |main_#t~mem10| |main_#t~mem11|))} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {812#false} is VALID [2018-11-23 11:19:40,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {893#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32)))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {889#(not (bvsgt |main_#t~mem10| |main_#t~mem11|))} is VALID [2018-11-23 11:19:40,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {893#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:19:40,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:19:40,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} goto; {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:19:40,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {907#(or |main_#t~short7| (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {897#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:19:40,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {911#(or |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {907#(or |main_#t~short7| (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:40,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(forall ((v_main_~order~0_4 (_ BitVec 32))) (or (bvslt v_main_~order~0_4 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_4) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {911#(or |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:40,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(forall ((v_main_~order~0_4 (_ BitVec 32))) (or (bvslt v_main_~order~0_4 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_4) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {915#(forall ((v_main_~order~0_4 (_ BitVec 32))) (or (bvslt v_main_~order~0_4 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_4) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:40,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {811#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {915#(forall ((v_main_~order~0_4 (_ BitVec 32))) (or (bvslt v_main_~order~0_4 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_4) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_4) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:40,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {811#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {811#true} is VALID [2018-11-23 11:19:40,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#true} goto; {811#true} is VALID [2018-11-23 11:19:40,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {811#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {811#true} is VALID [2018-11-23 11:19:40,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {811#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {811#true} is VALID [2018-11-23 11:19:40,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#true} goto; {811#true} is VALID [2018-11-23 11:19:40,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {811#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {811#true} is VALID [2018-11-23 11:19:40,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret13 := main(); {811#true} is VALID [2018-11-23 11:19:40,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #71#return; {811#true} is VALID [2018-11-23 11:19:40,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2018-11-23 11:19:40,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {811#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {811#true} is VALID [2018-11-23 11:19:40,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2018-11-23 11:19:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:19:40,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 11:19:40,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:40,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:19:41,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:41,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:19:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:19:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:19:41,003 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 15 states. [2018-11-23 11:19:43,028 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 16 [2018-11-23 11:19:45,314 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-11-23 11:19:45,560 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-11-23 11:19:45,811 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 11:19:46,048 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-11-23 11:19:47,681 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:19:48,227 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-11-23 11:19:49,078 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2018-11-23 11:19:49,521 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:19:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,076 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2018-11-23 11:19:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:19:51,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 11:19:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:19:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2018-11-23 11:19:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:19:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2018-11-23 11:19:51,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2018-11-23 11:19:51,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:51,637 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:19:51,637 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:19:51,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:19:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:19:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2018-11-23 11:19:51,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:51,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 37 states. [2018-11-23 11:19:51,696 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 37 states. [2018-11-23 11:19:51,696 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 37 states. [2018-11-23 11:19:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,699 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 11:19:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 11:19:51,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:51,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:51,700 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 51 states. [2018-11-23 11:19:51,700 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 51 states. [2018-11-23 11:19:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,703 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 11:19:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 11:19:51,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:51,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:51,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:51,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:19:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-23 11:19:51,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 22 [2018-11-23 11:19:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:51,707 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-23 11:19:51,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:19:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-23 11:19:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:19:51,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:51,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:51,709 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:51,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash -857816932, now seen corresponding path program 1 times [2018-11-23 11:19:51,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:51,710 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:19:51,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:51,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:51,928 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 19 treesize of output 16 [2018-11-23 11:19:51,935 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 1 [2018-11-23 11:19:51,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:51,977 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 19 treesize of output 16 [2018-11-23 11:19:51,983 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 1 [2018-11-23 11:19:51,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:51,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:51,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:51,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2018-11-23 11:19:52,108 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:19:52,126 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:19:52,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:52,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:52,141 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:19:52,148 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:19:52,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:52,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:52,155 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:19:52,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:19:52,160 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:52,161 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_17, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_17) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_17) (_ bv0 32)))) (and (= .cse0 main_~i~0.base) (= .cse0 (_ bv0 32)) (= main_~i~0.offset .cse1) (= (_ bv0 32) .cse1))) [2018-11-23 11:19:52,161 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:19:52,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2018-11-23 11:19:52,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1210#true} is VALID [2018-11-23 11:19:52,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2018-11-23 11:19:52,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #71#return; {1210#true} is VALID [2018-11-23 11:19:52,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret13 := main(); {1210#true} is VALID [2018-11-23 11:19:52,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {1210#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1210#true} is VALID [2018-11-23 11:19:52,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#true} goto; {1210#true} is VALID [2018-11-23 11:19:52,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {1210#true} is VALID [2018-11-23 11:19:52,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {1210#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1239#(= (_ bv0 32) main_~l~0.offset)} is VALID [2018-11-23 11:19:52,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {1239#(= (_ bv0 32) main_~l~0.offset)} goto; {1239#(= (_ bv0 32) main_~l~0.offset)} is VALID [2018-11-23 11:19:52,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1239#(= (_ bv0 32) main_~l~0.offset)} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1239#(= (_ bv0 32) main_~l~0.offset)} is VALID [2018-11-23 11:19:52,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {1239#(= (_ bv0 32) main_~l~0.offset)} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:52,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} goto; {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:52,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:52,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:52,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {1249#(and (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1262#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {1262#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset))} goto; {1262#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {1262#(and (= (_ bv0 32) main_~l~0.offset) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {1269#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:52,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {1269#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {1273#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1283#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:52,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {1283#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1211#false} is VALID [2018-11-23 11:19:52,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {1211#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1211#false} is VALID [2018-11-23 11:19:52,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2018-11-23 11:19:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:52,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:52,592 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:19:52,626 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:19:52,850 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 49 treesize of output 47 [2018-11-23 11:19:52,926 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 6 treesize of output 1 [2018-11-23 11:19:52,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:52,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,172 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 36 treesize of output 33 [2018-11-23 11:19:53,179 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 17 treesize of output 1 [2018-11-23 11:19:53,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,302 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 16 treesize of output 20 [2018-11-23 11:19:53,313 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 15 treesize of output 13 [2018-11-23 11:19:53,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,338 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:19:53,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,359 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 10 treesize of output 3 [2018-11-23 11:19:53,360 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:53,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:53,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:53,415 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:129, output treesize:7 [2018-11-23 11:19:55,547 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:55,548 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_16|, |v_#memory_$Pointer$.offset_15|, v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_1]. (let ((.cse1 (bvadd main_~i~0.offset (_ bv4 32)))) (and (let ((.cse0 (select |v_#memory_$Pointer$.base_16| main_~i~0.base)) (.cse2 (select |v_#memory_$Pointer$.offset_16| main_~i~0.base))) (or (not (= (select .cse0 main_~i~0.offset) (_ bv0 32))) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_16| main_~l~0.base) main_~l~0.offset)) (not (= |v_#memory_$Pointer$.base_16| (store |v_#memory_$Pointer$.base_15| main_~i~0.base (store (select |v_#memory_$Pointer$.base_15| main_~i~0.base) .cse1 (select .cse0 .cse1))))) (not (= (select .cse2 main_~i~0.offset) (_ bv0 32))) (not (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_15| main_~i~0.base (store (select |v_#memory_$Pointer$.offset_15| main_~i~0.base) .cse1 (select .cse2 .cse1))))))) (let ((.cse4 (select v_prenex_2 main_~i~0.base)) (.cse3 (select v_prenex_4 main_~i~0.base))) (or (not (= (select .cse3 main_~i~0.offset) (_ bv0 32))) (not (= v_prenex_2 (store v_prenex_3 main_~i~0.base (store (select v_prenex_3 main_~i~0.base) .cse1 (select .cse4 .cse1))))) (not (= (select .cse4 main_~i~0.offset) (_ bv0 32))) (= (select (select v_prenex_4 main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (not (= v_prenex_4 (store v_prenex_1 main_~i~0.base (store (select v_prenex_1 main_~i~0.base) .cse1 (select .cse3 .cse1))))))))) [2018-11-23 11:19:55,548 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset)) [2018-11-23 11:19:55,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2018-11-23 11:19:55,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {1211#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1211#false} is VALID [2018-11-23 11:19:55,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {1283#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1211#false} is VALID [2018-11-23 11:19:55,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1283#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:55,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:55,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:55,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {1312#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1302#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:55,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#(or (not (= (_ bv0 32) main_~i~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (not (= (_ bv0 32) main_~i~0.offset)))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {1312#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:55,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {1316#(or (not (= (_ bv0 32) main_~i~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (not (= (_ bv0 32) main_~i~0.offset)))} goto; {1316#(or (not (= (_ bv0 32) main_~i~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (not (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:55,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1316#(or (not (= (_ bv0 32) main_~i~0.base)) (and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (not (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:55,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:55,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:55,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} goto; {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:55,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {1210#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1323#(and (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset))} is VALID [2018-11-23 11:19:55,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {1210#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1210#true} is VALID [2018-11-23 11:19:55,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {1210#true} goto; {1210#true} is VALID [2018-11-23 11:19:55,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {1210#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1210#true} is VALID [2018-11-23 11:19:55,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#true} goto; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {1210#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret13 := main(); {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #71#return; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1210#true} is VALID [2018-11-23 11:19:55,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2018-11-23 11:19:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:55,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-11-23 11:19:55,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:19:55,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:55,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:19:55,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:55,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:19:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:19:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:19:55,727 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 12 states. [2018-11-23 11:19:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:59,218 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 11:19:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:19:59,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 11:19:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:19:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 11:19:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:19:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 11:19:59,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2018-11-23 11:19:59,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:59,413 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:19:59,414 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:19:59,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:19:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:19:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2018-11-23 11:19:59,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:59,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 38 states. [2018-11-23 11:19:59,507 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 38 states. [2018-11-23 11:19:59,507 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 38 states. [2018-11-23 11:19:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:59,510 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 11:19:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 11:19:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:59,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:59,511 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 51 states. [2018-11-23 11:19:59,511 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 51 states. [2018-11-23 11:19:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:59,513 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 11:19:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 11:19:59,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:59,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:59,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:59,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:19:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-11-23 11:19:59,516 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 25 [2018-11-23 11:19:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:59,517 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-11-23 11:19:59,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:19:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 11:19:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:19:59,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:59,518 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:59,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:59,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash -106586521, now seen corresponding path program 2 times [2018-11-23 11:19:59,519 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:59,519 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:19:59,551 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:19:59,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:19:59,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:19:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:59,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:59,735 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:19:59,743 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:19:59,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,767 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:19:59,773 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:19:59,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:19:59,996 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 23 treesize of output 18 [2018-11-23 11:20:00,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:20:00,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,196 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 23 treesize of output 18 [2018-11-23 11:20:00,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:20:00,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,413 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 23 treesize of output 18 [2018-11-23 11:20:00,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:20:00,435 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,490 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 23 treesize of output 18 [2018-11-23 11:20:00,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:20:00,506 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,511 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,524 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:20:00,534 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:20:00,535 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,539 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,550 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:20:00,556 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:20:00,562 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,565 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:00,572 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:89, output treesize:7 [2018-11-23 11:20:02,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:02,043 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_18|, |#memory_$Pointer$.offset|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.offset_19|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_19| main_~l~0.base)) (.cse2 (select |#memory_$Pointer$.offset| main_~l~0.base)) (.cse4 (select |v_#memory_$Pointer$.offset_18| main_~l~0.base)) (.cse1 (select |v_#memory_$Pointer$.base_18| main_~l~0.base)) (.cse3 (select |#memory_$Pointer$.base| main_~l~0.base)) (.cse5 (select |v_#memory_$Pointer$.offset_19| main_~l~0.base))) (and (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= |v_#memory_$Pointer$.base_18| (store |v_#memory_$Pointer$.base_19| main_~l~0.base (store .cse0 (_ bv8 32) (select .cse1 (_ bv8 32))))) (= (select .cse2 (_ bv0 32)) main_~i~0.offset) (= main_~i~0.base (select .cse3 (_ bv0 32))) (= (store |v_#memory_$Pointer$.offset_18| main_~l~0.base (store .cse4 (_ bv4 32) (select .cse2 (_ bv4 32)))) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_19| main_~l~0.base (store .cse5 (_ bv8 32) (select .cse4 (_ bv8 32)))) |v_#memory_$Pointer$.offset_18|) (= (store |v_#memory_$Pointer$.base_18| main_~l~0.base (store .cse1 (_ bv4 32) (select .cse3 (_ bv4 32)))) |#memory_$Pointer$.base|) (= (select .cse5 (_ bv0 32)) (_ bv0 32)))) [2018-11-23 11:20:02,043 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:20:02,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2018-11-23 11:20:02,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1622#true} is VALID [2018-11-23 11:20:02,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2018-11-23 11:20:02,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #71#return; {1622#true} is VALID [2018-11-23 11:20:02,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret13 := main(); {1622#true} is VALID [2018-11-23 11:20:02,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {1622#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:02,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:02,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:02,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:02,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} goto; {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:02,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:02,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {1652#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:20:02,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} goto; {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:20:02,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:20:02,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:20:02,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {1662#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~l~0.base) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) main_~i~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) (_ bv0 32))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:02,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} goto; {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:02,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1623#false} is VALID [2018-11-23 11:20:02,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {1623#false} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1623#false} is VALID [2018-11-23 11:20:02,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {1623#false} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1623#false} is VALID [2018-11-23 11:20:02,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#false} goto; {1623#false} is VALID [2018-11-23 11:20:02,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {1623#false} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {1623#false} is VALID [2018-11-23 11:20:02,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {1623#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1623#false} is VALID [2018-11-23 11:20:02,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {1623#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1623#false} is VALID [2018-11-23 11:20:02,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {1623#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1623#false} is VALID [2018-11-23 11:20:02,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2018-11-23 11:20:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:02,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:02,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:02,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:03,185 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:20:03,294 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:20:03,804 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:20:03,842 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:20:04,115 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,329 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:20:04,347 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:20:04,465 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,484 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,551 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,556 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,618 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:04,622 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:04,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:04,634 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:177, output treesize:25 [2018-11-23 11:20:06,702 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:06,703 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_21|, |v_#memory_$Pointer$.base_18|, v_prenex_7, v_prenex_9, v_prenex_6, v_prenex_8]. (let ((.cse3 (select |#memory_$Pointer$.base| main_~i~0.base)) (.cse2 (bvadd main_~i~0.offset (_ bv4 32))) (.cse6 (select |#memory_$Pointer$.offset| main_~i~0.base)) (.cse4 (bvadd main_~i~0.offset (_ bv8 32)))) (and (let ((.cse5 (select |v_#memory_$Pointer$.base_18| main_~i~0.base)) (.cse0 (select |v_#memory_$Pointer$.base_21| main_~i~0.base)) (.cse1 (select |v_#memory_$Pointer$.offset_18| main_~i~0.base))) (or (= (_ bv0 32) (select .cse0 main_~i~0.offset)) (not (= |v_#memory_$Pointer$.offset_21| (store |v_#memory_$Pointer$.offset_18| main_~i~0.base (store .cse1 .cse2 (select (select |v_#memory_$Pointer$.offset_21| main_~i~0.base) .cse2))))) (not (= |v_#memory_$Pointer$.base_18| (store |#memory_$Pointer$.base| main_~i~0.base (store .cse3 .cse4 (select .cse5 .cse4))))) (not (= |v_#memory_$Pointer$.base_21| (store |v_#memory_$Pointer$.base_18| main_~i~0.base (store .cse5 .cse2 (select .cse0 .cse2))))) (not (= |v_#memory_$Pointer$.offset_18| (store |#memory_$Pointer$.offset| main_~i~0.base (store .cse6 .cse4 (select .cse1 .cse4))))))) (let ((.cse7 (select v_prenex_9 main_~i~0.base)) (.cse9 (select v_prenex_6 main_~i~0.base)) (.cse8 (select v_prenex_8 main_~i~0.base))) (or (not (= v_prenex_7 (store v_prenex_9 main_~i~0.base (store .cse7 .cse2 (select (select v_prenex_7 main_~i~0.base) .cse2))))) (not (= v_prenex_9 (store |#memory_$Pointer$.base| main_~i~0.base (store .cse3 .cse4 (select .cse7 .cse4))))) (not (= v_prenex_6 (store v_prenex_8 main_~i~0.base (store .cse8 .cse2 (select .cse9 .cse2))))) (= (_ bv0 32) (select .cse9 main_~i~0.offset)) (not (= v_prenex_8 (store |#memory_$Pointer$.offset| main_~i~0.base (store .cse6 .cse4 (select .cse8 .cse4))))))))) [2018-11-23 11:20:06,703 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_18, v_DerPreprocessor_12]. (let ((.cse0 (bvadd main_~i~0.offset (_ bv8 32)))) (and (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) .cse0 v_DerPreprocessor_18) main_~i~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) .cse0 v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32)))) [2018-11-23 11:20:06,953 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 13 treesize of output 11 [2018-11-23 11:20:06,956 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 11 treesize of output 15 [2018-11-23 11:20:06,975 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 12 treesize of output 3 [2018-11-23 11:20:06,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,990 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 13 treesize of output 11 [2018-11-23 11:20:06,994 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 11 treesize of output 15 [2018-11-23 11:20:07,035 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 12 treesize of output 3 [2018-11-23 11:20:07,037 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:07,048 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:27, output treesize:7 [2018-11-23 11:20:07,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2018-11-23 11:20:07,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {1623#false} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {1623#false} is VALID [2018-11-23 11:20:07,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {1623#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1623#false} is VALID [2018-11-23 11:20:07,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {1623#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1623#false} is VALID [2018-11-23 11:20:07,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {1623#false} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {1623#false} is VALID [2018-11-23 11:20:07,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#false} goto; {1623#false} is VALID [2018-11-23 11:20:07,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {1623#false} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1623#false} is VALID [2018-11-23 11:20:07,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {1623#false} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1623#false} is VALID [2018-11-23 11:20:07,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1623#false} is VALID [2018-11-23 11:20:07,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} goto; {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:07,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:07,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} goto; {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1736#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~i~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~i~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} goto; {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1749#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= (_ bv0 32) (select (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_18) main_~l~0.offset))) (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (store (select |#memory_$Pointer$.offset| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_12) main_~l~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:20:07,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:07,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:07,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {1622#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1642#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:07,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret13 := main(); {1622#true} is VALID [2018-11-23 11:20:07,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #71#return; {1622#true} is VALID [2018-11-23 11:20:07,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2018-11-23 11:20:07,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1622#true} is VALID [2018-11-23 11:20:07,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2018-11-23 11:20:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:07,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:07,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 11:20:07,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:20:07,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:07,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:20:07,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:07,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:20:07,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:20:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:20:07,157 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 8 states. [2018-11-23 11:20:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:10,454 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2018-11-23 11:20:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:20:10,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:20:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-23 11:20:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-23 11:20:10,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-23 11:20:10,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:10,590 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:20:10,590 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:20:10,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:20:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:20:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 11:20:10,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:10,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 11:20:10,929 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:20:10,929 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:20:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:10,930 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:20:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:20:10,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:10,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:10,932 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:20:10,932 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:20:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:10,934 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:20:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:20:10,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:10,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:10,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:10,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:20:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 11:20:10,941 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 26 [2018-11-23 11:20:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:10,941 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-23 11:20:10,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:20:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:20:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:20:10,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:10,942 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:10,942 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:10,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1548876935, now seen corresponding path program 3 times [2018-11-23 11:20:10,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:10,943 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:20:10,961 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:20:11,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:20:11,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:20:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:11,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:11,198 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:20:11,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:20:11,205 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:11,205 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_19|]. (= |#valid| (store |v_#valid_19| main_~l~0.base (_ bv1 1))) [2018-11-23 11:20:11,206 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| main_~l~0.base)) [2018-11-23 11:20:11,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,269 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 11 treesize of output 4 [2018-11-23 11:20:11,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,369 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 25 treesize of output 22 [2018-11-23 11:20:11,376 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 22 treesize of output 25 [2018-11-23 11:20:11,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:20:11,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:11,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-11-23 11:20:11,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:20:11,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:20:11,536 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,573 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:54, output treesize:31 [2018-11-23 11:20:11,599 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:11,599 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~stock~0, |v_#valid_20|, v_main_~l~0.base_9, |v_#memory_$Pointer$.base_23|]. (and (= (_ bv1 1) (select |v_#valid_20| v_main_~l~0.base_9)) (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~stock~0 (_ bv0 32))) (= (select |v_#valid_20| main_~l~0.base) (_ bv0 1)) (= (store |v_#memory_int_19| main_~l~0.base (store (store (store (select |v_#memory_int_19| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) main_~stock~0) (bvadd main_~l~0.offset (_ bv8 32)) (_ bv0 32)) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_23| main_~l~0.base (store (select |v_#memory_$Pointer$.base_23| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_9)))) [2018-11-23 11:20:11,599 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))) [2018-11-23 11:20:12,070 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 59 treesize of output 48 [2018-11-23 11:20:12,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:12,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-23 11:20:12,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:12,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-23 11:20:12,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,402 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 28 treesize of output 23 [2018-11-23 11:20:12,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:12,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 11:20:12,425 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,509 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 28 treesize of output 23 [2018-11-23 11:20:12,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:12,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 11:20:12,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,578 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 16 treesize of output 12 [2018-11-23 11:20:12,587 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 12 treesize of output 4 [2018-11-23 11:20:12,589 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:12,625 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:119, output treesize:34 [2018-11-23 11:20:12,771 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:12,772 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, main_~order~0, |v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_25|, |#memory_$Pointer$.base|]. (let ((.cse1 (select |v_#memory_int_20| main_~l~0.base)) (.cse6 (bvadd main_~l~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse1 .cse6)) (.cse4 (select |v_#memory_$Pointer$.base_24| main_~l~0.base)) (.cse5 (select |#memory_$Pointer$.base| main_~l~0.base)) (.cse3 (select |v_#memory_$Pointer$.base_25| main_~l~0.base)) (.cse2 (bvadd main_~l~0.offset (_ bv8 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (bvslt .cse0 (_ bv0 32))) (not (bvslt main_~order~0 (_ bv0 32))) (not (bvslt .cse0 main_~order~0)) (= (_ bv0 32) (select .cse1 .cse2)) (= (store |v_#memory_$Pointer$.base_25| main_~l~0.base (store .cse3 .cse2 (select .cse4 .cse2))) |v_#memory_$Pointer$.base_24|) (= (select .cse5 main_~l~0.offset) main_~i~0.base) (= (store |v_#memory_$Pointer$.base_24| main_~l~0.base (store .cse4 .cse6 (select .cse5 .cse6))) |#memory_$Pointer$.base|) (not (= (select .cse3 main_~l~0.offset) main_~l~0.base)) (= |#memory_int| (store |v_#memory_int_20| main_~l~0.base (let ((.cse7 (store .cse1 .cse2 main_~order~0))) (store .cse7 .cse6 (select .cse7 .cse6)))))))) [2018-11-23 11:20:12,772 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~l~0.base))) (let ((.cse1 (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (and (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (= (_ bv0 32) main_~l~0.offset) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt .cse1 (_ bv0 32)))))) [2018-11-23 11:20:12,879 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 56 treesize of output 55 [2018-11-23 11:20:12,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:12,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-11-23 11:20:12,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:13,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-23 11:20:13,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:13,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:13,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:13,091 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:20:13,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:30 [2018-11-23 11:20:13,135 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:13,136 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~i~0.base_28, v_main_~i~0.offset_28, main_~order~0]. (let ((.cse0 (select |v_#memory_int_21| main_~l~0.base))) (let ((.cse1 (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (and (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (not (bvslt .cse1 (_ bv0 32))) (= |#memory_int| (store |v_#memory_int_21| v_main_~i~0.base_28 (let ((.cse2 (store (select |v_#memory_int_21| v_main_~i~0.base_28) (bvadd v_main_~i~0.offset_28 (_ bv8 32)) main_~order~0)) (.cse3 (bvadd v_main_~i~0.offset_28 (_ bv4 32)))) (store .cse2 .cse3 (select .cse2 .cse3))))) (= (_ bv0 32) main_~l~0.offset) (not (= v_main_~i~0.base_28 main_~l~0.base))))) [2018-11-23 11:20:13,136 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~l~0.base))) (let ((.cse1 (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (not (bvslt .cse1 (_ bv0 32)))))) [2018-11-23 11:20:13,277 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 35 treesize of output 25 [2018-11-23 11:20:13,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-11-23 11:20:13,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:13,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:13,319 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:20:13,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2018-11-23 11:20:13,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:13,327 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse2 (select |#memory_int| main_~i~0.base))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv8 32)))) (and (not (bvslt .cse0 .cse1)) (not (bvslt .cse1 (_ bv0 32))) (= .cse0 |main_#t~mem11|) (= |main_#t~mem10| .cse1)))) [2018-11-23 11:20:13,328 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32)))) [2018-11-23 11:20:13,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-23 11:20:13,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2028#true} is VALID [2018-11-23 11:20:13,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-23 11:20:13,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #71#return; {2028#true} is VALID [2018-11-23 11:20:13,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret13 := main(); {2028#true} is VALID [2018-11-23 11:20:13,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {2028#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2028#true} is VALID [2018-11-23 11:20:13,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {2028#true} goto; {2028#true} is VALID [2018-11-23 11:20:13,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {2028#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2028#true} is VALID [2018-11-23 11:20:13,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:13,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} goto; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:13,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:13,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} goto; {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {2067#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2077#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {2077#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} goto; {2077#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {2077#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2084#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {2084#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2088#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:20:13,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {2088#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= main_~l~0.base main_~i~0.base) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} goto; {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {2092#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= main_~l~0.base main_~i~0.base)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} goto; {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:13,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {2105#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2115#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv8 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:13,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {2115#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (_ bv8 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2119#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} is VALID [2018-11-23 11:20:13,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {2119#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {2029#false} is VALID [2018-11-23 11:20:13,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-23 11:20:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:13,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:16,035 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:20:16,076 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:20:16,210 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:20:16,249 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:20:16,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:16,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:290, output treesize:310 [2018-11-23 11:20:16,619 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:16,620 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_27|, v_subst_2, v_subst_1, |v_#memory_$Pointer$.base_24|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_24| main_~i~0.base)) (.cse2 (select |v_#memory_$Pointer$.base_27| main_~i~0.base)) (.cse1 (bvadd main_~i~0.offset (_ bv4 32))) (.cse3 (bvadd main_~i~0.offset (_ bv8 32)))) (or |main_#t~short7| (not (= |v_#memory_$Pointer$.base_27| (store |v_#memory_$Pointer$.base_24| main_~i~0.base (store .cse0 .cse1 (select .cse2 .cse1))))) (not (= |v_#memory_$Pointer$.base_24| (store |#memory_$Pointer$.base| main_~i~0.base (store (select |#memory_$Pointer$.base| main_~i~0.base) .cse3 (select .cse0 .cse3))))) (not (let ((.cse4 (select (let ((.cse5 (store |#memory_int| main_~i~0.base (let ((.cse9 (store (select |#memory_int| main_~i~0.base) .cse3 main_~order~0))) (store .cse9 .cse1 (select .cse9 .cse1))))) (.cse6 (select .cse2 main_~i~0.offset))) (store .cse5 .cse6 (let ((.cse7 (store (select .cse5 .cse6) (bvadd v_subst_2 (_ bv8 32)) v_subst_1)) (.cse8 (bvadd v_subst_2 (_ bv4 32)))) (store .cse7 .cse8 (select .cse7 .cse8))))) main_~l~0.base))) (bvsgt (select .cse4 (bvadd main_~l~0.offset (_ bv8 32))) (select .cse4 (bvadd main_~l~0.offset (_ bv4 32)))))))) [2018-11-23 11:20:16,620 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_20, v_DerPreprocessor_22, v_subst_2, v_subst_1]. (or |main_#t~short7| (not (let ((.cse0 (select (let ((.cse6 (bvadd main_~i~0.offset (_ bv4 32))) (.cse5 (bvadd main_~i~0.offset (_ bv8 32)))) (let ((.cse1 (store |#memory_int| main_~i~0.base (let ((.cse7 (store (select |#memory_int| main_~i~0.base) .cse5 main_~order~0))) (store .cse7 .cse6 (select .cse7 .cse6))))) (.cse2 (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) .cse5 v_DerPreprocessor_20) .cse6 v_DerPreprocessor_22) main_~i~0.offset))) (store .cse1 .cse2 (let ((.cse3 (store (select .cse1 .cse2) (bvadd v_subst_2 (_ bv8 32)) v_subst_1)) (.cse4 (bvadd v_subst_2 (_ bv4 32)))) (store .cse3 .cse4 (select .cse3 .cse4)))))) main_~l~0.base))) (bvsgt (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))) (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))))))) [2018-11-23 11:20:17,333 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:20:23,974 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2018-11-23 11:20:24,111 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:20:24,125 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:20:24,170 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:20:24,294 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 285 treesize of output 233 [2018-11-23 11:20:24,794 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-23 11:20:24,809 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 214 treesize of output 187 [2018-11-23 11:20:24,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 143 [2018-11-23 11:20:24,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 116 [2018-11-23 11:20:24,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 101 [2018-11-23 11:20:25,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 82 [2018-11-23 11:20:25,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,085 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,291 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 79 treesize of output 65 [2018-11-23 11:20:25,357 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:25,363 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:25,381 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:25,418 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:25,466 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:25,470 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-23 11:20:25,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 90 [2018-11-23 11:20:26,303 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 66 [2018-11-23 11:20:26,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,326 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:26,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,346 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:26,425 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-23 11:20:26,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 11:20:26,431 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,598 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:26,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-11-23 11:20:26,610 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,645 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:26,674 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:26,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:26,845 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 31 treesize of output 29 [2018-11-23 11:20:26,852 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 15 treesize of output 19 [2018-11-23 11:20:26,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:20:26,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-23 11:20:26,894 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,899 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,904 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,924 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,930 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 31 treesize of output 29 [2018-11-23 11:20:26,936 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 15 treesize of output 19 [2018-11-23 11:20:26,960 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:20:26,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-23 11:20:26,989 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,995 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,000 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,022 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,093 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:292, output treesize:6 [2018-11-23 11:20:27,137 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:27,138 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_23|, v_main_~l~0.base_10, v_DerPreprocessor_20, v_DerPreprocessor_22, |v_#memory_int_24|, v_main_~order~0_9, v_subst_2, v_subst_1, |#memory_int|, main_~stock~0]. (let ((.cse6 (select |v_#memory_int_24| v_main_~l~0.base_10))) (or (not (let ((.cse0 (select (let ((.cse1 (store |v_#memory_int_24| v_main_~l~0.base_10 (let ((.cse5 (store .cse6 (_ bv8 32) v_main_~order~0_9))) (store .cse5 (_ bv4 32) (select .cse5 (_ bv4 32)))))) (.cse2 (select (store (store (store (select |v_#memory_$Pointer$.base_23| v_main_~l~0.base_10) (_ bv0 32) main_~l~0.base) (_ bv8 32) v_DerPreprocessor_20) (_ bv4 32) v_DerPreprocessor_22) (_ bv0 32)))) (store .cse1 .cse2 (let ((.cse3 (store (select .cse1 .cse2) (bvadd v_subst_2 (_ bv8 32)) v_subst_1)) (.cse4 (bvadd v_subst_2 (_ bv4 32)))) (store .cse3 .cse4 (select .cse3 .cse4))))) v_main_~l~0.base_10))) (bvsgt (select .cse0 (_ bv8 32)) (select .cse0 (_ bv4 32))))) (not (= (store |#memory_int| v_main_~l~0.base_10 (store (store (store (select |#memory_int| v_main_~l~0.base_10) (_ bv4 32) main_~stock~0) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select .cse6 (_ bv0 32)))) |v_#memory_int_24|)) (bvslt v_main_~order~0_9 (_ bv0 32)) (bvslt main_~stock~0 (_ bv0 32)) (bvslt (select .cse6 (_ bv4 32)) v_main_~order~0_9) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_10))))) [2018-11-23 11:20:27,138 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (not (= (_ bv0 1) (select |#valid| main_~l~0.base))) [2018-11-23 11:20:27,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-23 11:20:27,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {2129#(not (bvsgt |main_#t~mem10| |main_#t~mem11|))} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {2029#false} is VALID [2018-11-23 11:20:27,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {2133#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32)))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2129#(not (bvsgt |main_#t~mem10| |main_#t~mem11|))} is VALID [2018-11-23 11:20:27,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2133#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:27,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:27,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} goto; {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:27,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2137#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:27,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:20:27,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:20:27,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} goto; {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:20:27,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {2160#(or |main_#t~short7| (forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2147#(forall ((main_~order~0 (_ BitVec 32)) (main_~i~0.offset (_ BitVec 32))) (not (bvsgt (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:20:27,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {2164#(or |main_#t~short7| (forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2160#(or |main_#t~short7| (forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:29,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2168#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (bvslt v_main_~order~0_9 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_9)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2164#(or |main_#t~short7| (forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) main_~order~0) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0))} is UNKNOWN [2018-11-23 11:20:29,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {2168#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (bvslt v_main_~order~0_9 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_9)))} goto; {2168#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (bvslt v_main_~order~0_9 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_9)))} is VALID [2018-11-23 11:20:31,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2168#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (not (bvsgt (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset) (store (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~i~0.base (store (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~i~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~i~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~i~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (bvslt v_main_~order~0_9 (_ bv0 32)) (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) v_main_~order~0_9)))} is UNKNOWN [2018-11-23 11:20:31,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:31,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:31,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2175#(forall ((v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~order~0_9 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) v_main_~order~0_9) (bvslt v_main_~order~0_9 (_ bv0 32)) (not (bvsgt (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (select (select (store (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset) (store (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32)) (select (store (select (store |#memory_int| main_~l~0.base (store (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32)) (select (store (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_main_~order~0_9) (bvadd main_~l~0.offset (_ bv4 32))))) (select (store (store (select |#memory_$Pointer$.base| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32)) v_DerPreprocessor_20) (bvadd main_~l~0.offset (_ bv4 32)) v_DerPreprocessor_22) main_~l~0.offset)) (bvadd v_subst_2 (_ bv8 32)) v_subst_1) (bvadd v_subst_2 (_ bv4 32))))) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:31,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:31,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} goto; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:31,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2057#(= (_ bv1 1) (select |#valid| main_~l~0.base))} is VALID [2018-11-23 11:20:31,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {2028#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2028#true} is VALID [2018-11-23 11:20:31,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {2028#true} goto; {2028#true} is VALID [2018-11-23 11:20:31,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {2028#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2028#true} is VALID [2018-11-23 11:20:31,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret13 := main(); {2028#true} is VALID [2018-11-23 11:20:31,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #71#return; {2028#true} is VALID [2018-11-23 11:20:31,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-23 11:20:31,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2028#true} is VALID [2018-11-23 11:20:31,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-23 11:20:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:31,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 11:20:31,437 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 11:20:31,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:31,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:20:35,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 44 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:35,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:20:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:20:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:20:35,920 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 19 states. [2018-11-23 11:20:51,025 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2018-11-23 11:20:55,576 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-23 11:21:15,677 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-23 11:21:44,537 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 11:21:52,421 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:21:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:58,005 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 11:21:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:21:58,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 11:21:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:21:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 11:21:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:21:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 11:21:58,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2018-11-23 11:22:00,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:00,274 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:22:00,274 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:22:00,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=252, Invalid=797, Unknown=7, NotChecked=0, Total=1056 [2018-11-23 11:22:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:22:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-11-23 11:22:00,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:00,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 50 states. [2018-11-23 11:22:00,393 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 50 states. [2018-11-23 11:22:00,394 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 50 states. [2018-11-23 11:22:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:00,397 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 11:22:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-23 11:22:00,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:00,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:00,398 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 57 states. [2018-11-23 11:22:00,398 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 57 states. [2018-11-23 11:22:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:00,401 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 11:22:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-23 11:22:00,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:00,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:00,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:00,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:22:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2018-11-23 11:22:00,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 29 [2018-11-23 11:22:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:00,404 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2018-11-23 11:22:00,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:22:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-23 11:22:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:22:00,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:00,405 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:00,405 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:00,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1755210913, now seen corresponding path program 2 times [2018-11-23 11:22:00,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:00,406 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:22:00,437 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:22:00,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:22:00,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:00,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:00,727 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:22:00,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,797 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 25 treesize of output 22 [2018-11-23 11:22:00,802 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 22 treesize of output 25 [2018-11-23 11:22:00,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:22:00,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-11-23 11:22:00,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,932 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-11-23 11:22:00,954 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:00,954 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, main_~stock~0, |v_#valid_26|]. (and (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_int_26| main_~l~0.base (store (store (store (select |v_#memory_int_26| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) main_~stock~0) (bvadd main_~l~0.offset (_ bv8 32)) (_ bv0 32)) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (not (bvslt main_~stock~0 (_ bv0 32))) (= |#valid| (store |v_#valid_26| main_~l~0.base (_ bv1 1)))) [2018-11-23 11:22:00,954 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))) [2018-11-23 11:22:01,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,067 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 11 treesize of output 4 [2018-11-23 11:22:01,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:22:01,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:22:01,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:22:01,470 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:22:01,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,600 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 41 treesize of output 50 [2018-11-23 11:22:01,610 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 22 treesize of output 25 [2018-11-23 11:22:01,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:22:01,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-11-23 11:22:01,692 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,711 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,749 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:02,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:02,001 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:76, output treesize:51 [2018-11-23 11:22:02,174 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:02,174 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, main_~stock~0, v_main_~l~0.base_12, |v_#valid_27|, |v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_30|]. (let ((.cse0 (select |v_#memory_int_27| v_main_~l~0.base_12))) (and (not (bvslt (select .cse0 (_ bv4 32)) (_ bv0 32))) (= (_ bv1 1) (select |v_#valid_27| v_main_~l~0.base_12)) (= (_ bv0 32) main_~l~0.offset) (= (select |v_#valid_27| main_~l~0.base) (_ bv0 1)) (= (store |v_#memory_int_27| main_~l~0.base (store (store (store (select |v_#memory_int_27| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) main_~stock~0) (bvadd main_~l~0.offset (_ bv8 32)) (_ bv0 32)) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (= (select .cse0 (_ bv8 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_27| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_27| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_30| main_~l~0.base (store (select |v_#memory_$Pointer$.base_30| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_12))))) [2018-11-23 11:22:02,175 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse0 (select |#memory_int| .cse1))) (and (not (bvslt (select .cse0 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= .cse1 main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select .cse0 (_ bv8 32)) (_ bv0 32))))) [2018-11-23 11:22:02,490 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:22:02,766 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-11-23 11:22:02,767 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 51 treesize of output 42 [2018-11-23 11:22:02,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:02,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 11:22:02,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:03,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:03,721 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 27 treesize of output 22 [2018-11-23 11:22:03,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:03,809 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:22:03,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:03,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,274 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 51 treesize of output 42 [2018-11-23 11:22:04,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:04,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 11:22:04,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,408 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,645 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 62 treesize of output 63 [2018-11-23 11:22:04,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:04,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 11:22:04,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:04,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-23 11:22:04,772 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,788 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,898 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 27 treesize of output 22 [2018-11-23 11:22:04,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:04,915 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:22:04,917 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,929 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:04,973 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:170, output treesize:56 [2018-11-23 11:22:06,982 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:06,982 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, main_~order~0, |v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_31|]. (let ((.cse11 (select |v_#memory_$Pointer$.base_33| main_~l~0.base))) (let ((.cse10 (select .cse11 main_~l~0.offset))) (let ((.cse0 (select |v_#memory_int_28| .cse10)) (.cse1 (select |v_#memory_$Pointer$.offset_30| main_~l~0.base)) (.cse7 (select |#memory_$Pointer$.base| main_~l~0.base)) (.cse6 (select |v_#memory_$Pointer$.offset_28| main_~l~0.base)) (.cse3 (bvadd main_~l~0.offset (_ bv4 32))) (.cse4 (select |v_#memory_int_28| main_~l~0.base)) (.cse9 (select |#memory_$Pointer$.offset| main_~l~0.base)) (.cse8 (select |v_#memory_$Pointer$.base_31| main_~l~0.base)) (.cse5 (bvadd main_~l~0.offset (_ bv8 32)))) (and (not (bvslt (select .cse0 (_ bv4 32)) (_ bv0 32))) (= (select .cse1 main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse0 (_ bv8 32))) (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_int_28| main_~l~0.base (let ((.cse2 (store .cse4 .cse5 main_~order~0))) (store .cse2 .cse3 (select .cse2 .cse3)))) |#memory_int|) (= |v_#memory_$Pointer$.offset_28| (store |v_#memory_$Pointer$.offset_30| main_~l~0.base (store .cse1 .cse5 (select .cse6 .cse5)))) (= (select .cse7 main_~l~0.offset) main_~i~0.base) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_31| main_~l~0.base (store .cse8 .cse3 (select .cse7 .cse3)))) (= (store |v_#memory_$Pointer$.offset_28| main_~l~0.base (store .cse6 .cse3 (select .cse9 .cse3))) |#memory_$Pointer$.offset|) (= (select .cse4 .cse5) (_ bv0 32)) (= (select .cse9 main_~l~0.offset) main_~i~0.offset) (not (= .cse10 main_~l~0.base)) (= |v_#memory_$Pointer$.base_31| (store |v_#memory_$Pointer$.base_33| main_~l~0.base (store .cse11 .cse5 (select .cse8 .cse5)))))))) [2018-11-23 11:22:06,983 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (.cse0 (select |#memory_int| .cse2))) (and (not (bvslt (select .cse0 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) .cse1) (not (= .cse2 main_~l~0.base)) (= .cse2 main_~i~0.base) (= .cse1 main_~i~0.offset) (= (select .cse0 (_ bv8 32)) (_ bv0 32))))) [2018-11-23 11:22:07,592 INFO L303 Elim1Store]: Index analysis took 241 ms [2018-11-23 11:22:07,593 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 239 treesize of output 240 [2018-11-23 11:22:07,632 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 32 treesize of output 1 [2018-11-23 11:22:07,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:08,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:08,489 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:22:08,526 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:22:08,980 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-23 11:22:08,981 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 182 treesize of output 178 [2018-11-23 11:22:09,002 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 41 treesize of output 44 [2018-11-23 11:22:09,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:09,042 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 44 treesize of output 34 [2018-11-23 11:22:09,044 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,086 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,409 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 139 treesize of output 140 [2018-11-23 11:22:09,418 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 32 treesize of output 1 [2018-11-23 11:22:09,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,471 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,568 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 87 treesize of output 62 [2018-11-23 11:22:09,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:09,619 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:09,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 69 [2018-11-23 11:22:09,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:09,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-23 11:22:09,659 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,680 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,697 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,745 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:277, output treesize:69 [2018-11-23 11:22:11,769 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:11,770 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, |v_#memory_int_29|, |v_#memory_$Pointer$.offset_31|, main_~order~0, |v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_29|]. (let ((.cse7 (select (select |v_#memory_$Pointer$.offset_31| main_~l~0.base) main_~l~0.offset)) (.cse0 (select (select |v_#memory_$Pointer$.base_34| main_~l~0.base) main_~l~0.offset))) (let ((.cse5 (select |v_#memory_$Pointer$.offset_29| .cse0)) (.cse1 (bvadd .cse7 (_ bv8 32))) (.cse2 (select |v_#memory_$Pointer$.base_32| .cse0)) (.cse4 (bvadd .cse7 (_ bv4 32))) (.cse3 (select |v_#memory_int_29| .cse0))) (and (= |v_#memory_$Pointer$.base_32| (store |v_#memory_$Pointer$.base_34| .cse0 (store (select |v_#memory_$Pointer$.base_34| .cse0) .cse1 (select .cse2 .cse1)))) (= (select .cse3 (_ bv8 32)) (_ bv0 32)) (not (bvslt (select .cse3 .cse4) main_~order~0)) (= (store |v_#memory_$Pointer$.offset_29| .cse0 (store .cse5 .cse4 (select (select |#memory_$Pointer$.offset| .cse0) .cse4))) |#memory_$Pointer$.offset|) (not (= .cse0 main_~l~0.base)) (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_$Pointer$.offset_31| .cse0 (store (select |v_#memory_$Pointer$.offset_31| .cse0) .cse1 (select .cse5 .cse1))) |v_#memory_$Pointer$.offset_29|) (not (bvslt main_~order~0 (_ bv0 32))) (= (store |v_#memory_int_29| .cse0 (let ((.cse6 (store .cse3 .cse1 main_~order~0))) (store .cse6 .cse4 (select .cse6 .cse4)))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_32| .cse0 (store .cse2 .cse4 (select (select |#memory_$Pointer$.base| .cse0) .cse4))) |#memory_$Pointer$.base|) (= (_ bv0 32) .cse7) (not (bvslt (select .cse3 (_ bv4 32)) (_ bv0 32)))))) [2018-11-23 11:22:11,770 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse0 (select |#memory_int| .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (let ((.cse2 (select .cse0 (bvadd .cse1 (_ bv8 32))))) (and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select .cse0 (bvadd .cse1 (_ bv4 32))) .cse2)) (= (_ bv0 32) .cse1) (not (= .cse3 main_~l~0.base)) (not (bvslt .cse2 (_ bv0 32))))))) [2018-11-23 11:22:11,999 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 65 treesize of output 55 [2018-11-23 11:22:12,010 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 55 treesize of output 42 [2018-11-23 11:22:12,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,061 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 54 treesize of output 44 [2018-11-23 11:22:12,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-11-23 11:22:12,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,104 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:22:12,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:30 [2018-11-23 11:22:12,126 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:12,126 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_35, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_35) (_ bv0 32)))) (let ((.cse3 (select |#memory_int| .cse0)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_35) (_ bv0 32)))) (let ((.cse2 (select .cse3 (bvadd .cse1 (_ bv8 32))))) (and (= .cse0 main_~i~0.base) (= .cse1 main_~i~0.offset) (not (bvslt .cse2 (_ bv0 32))) (not (bvslt (select .cse3 (bvadd .cse1 (_ bv4 32))) .cse2)) (= (_ bv0 32) .cse1) (not (= .cse0 v_main_~i~0.base_35)))))) [2018-11-23 11:22:12,126 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| main_~i~0.base))) (let ((.cse0 (select .cse1 (bvadd main_~i~0.offset (_ bv8 32))))) (and (not (bvslt .cse0 (_ bv0 32))) (not (bvslt (select .cse1 (bvadd main_~i~0.offset (_ bv4 32))) .cse0)) (= (_ bv0 32) main_~i~0.offset)))) [2018-11-23 11:22:12,190 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 35 treesize of output 25 [2018-11-23 11:22:12,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-11-23 11:22:12,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,237 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:22:12,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2018-11-23 11:22:12,246 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:12,246 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse2 (select |#memory_int| main_~i~0.base))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv8 32)))) (and (not (bvslt .cse0 .cse1)) (not (bvslt .cse1 (_ bv0 32))) (= .cse0 |main_#t~mem11|) (= |main_#t~mem10| .cse1)))) [2018-11-23 11:22:12,247 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32)))) [2018-11-23 11:22:12,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2018-11-23 11:22:12,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2525#true} is VALID [2018-11-23 11:22:12,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-23 11:22:12,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #71#return; {2525#true} is VALID [2018-11-23 11:22:12,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret13 := main(); {2525#true} is VALID [2018-11-23 11:22:12,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {2525#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2525#true} is VALID [2018-11-23 11:22:12,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {2525#true} goto; {2525#true} is VALID [2018-11-23 11:22:12,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {2525#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2525#true} is VALID [2018-11-23 11:22:12,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} goto; {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~stock~0 := #t~nondet3;havoc #t~nondet3; {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {2554#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)))} assume !~bvslt32(~stock~0, 0bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc4.base, #t~malloc4.offset;call write~intINTTYPE4(~stock~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} goto; {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} goto; {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {2574#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~l~0.base main_~i~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= main_~l~0.offset main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2587#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {2587#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} goto; {2587#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {2587#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);~order~0 := #t~nondet5;havoc #t~nondet5;#t~short7 := ~bvslt32(~order~0, 0bv32); {2594#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {2594#(and (or (and (not (bvslt main_~order~0 (_ bv0 32))) (not |main_#t~short7|)) (and |main_#t~short7| (bvslt main_~order~0 (_ bv0 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !#t~short7;call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short7 := ~bvslt32(#t~mem6, ~order~0); {2598#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:12,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {2598#(and (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~order~0 (_ bv0 32))) (or (and |main_#t~short7| (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~order~0)) (not |main_#t~short7|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) main_~i~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv0 32)))} assume !#t~short7;havoc #t~mem6;havoc #t~short7;call write~intINTTYPE4(~order~0, ~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem8 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);call write~intINTTYPE4(#t~mem8, ~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} goto; {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} assume !(~i~0.base != 0bv32 || ~i~0.offset != 0bv32); {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {2602#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} assume !~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-23 11:22:12,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {2612#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv4 32))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {2622#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv0 32))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:12,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {2622#(and (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv0 32))) (not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);call #t~mem11 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2626#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} is VALID [2018-11-23 11:22:12,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {2626#(and (not (bvslt |main_#t~mem11| |main_#t~mem10|)) (not (bvslt |main_#t~mem10| (_ bv0 32))))} assume ~bvsgt32(#t~mem10, #t~mem11);havoc #t~mem10;havoc #t~mem11; {2526#false} is VALID [2018-11-23 11:22:12,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2018-11-23 11:22:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:12,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:16,760 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:22:16,863 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:22:17,351 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:22:17,395 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:22:17,701 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:22:17,744 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:22:18,115 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:18,116 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:22:18,123 INFO L168 Benchmark]: Toolchain (without parser) took 169076.10 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:22:18,124 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:22:18,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.0 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:22:18,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.45 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:22:18,124 INFO L168 Benchmark]: Boogie Preprocessor took 89.05 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:22:18,125 INFO L168 Benchmark]: RCFGBuilder took 1095.45 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:22:18,125 INFO L168 Benchmark]: TraceAbstraction took 166960.26 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 326.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -280.6 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:22:18,130 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.0 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.45 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.05 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 1095.45 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166960.26 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 326.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -280.6 MB). Peak memory consumption was 45.5 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...