java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:04:28,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:04:28,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:04:28,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:04:28,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:04:28,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:04:28,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:04:28,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:04:28,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:04:28,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:04:28,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:04:28,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:04:28,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:04:28,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:04:28,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:04:28,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:04:28,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:04:28,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:04:28,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:04:28,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:04:28,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:04:28,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:04:28,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:04:28,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:04:28,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:04:28,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:04:28,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:04:28,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:04:28,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:04:28,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:04:28,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:04:28,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:04:28,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:04:28,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:04:28,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:04:28,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:04:28,200 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-14 16:04:28,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:04:28,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:04:28,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:04:28,217 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:04:28,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:04:28,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:04:28,218 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:04:28,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:04:28,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:04:28,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:04:28,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:04:28,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:04:28,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:04:28,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:04:28,219 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:04:28,220 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:04:28,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:04:28,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:04:28,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:04:28,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:04:28,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:04:28,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:04:28,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:04:28,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:04:28,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:04:28,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:04:28,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:04:28,222 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:04:28,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:04:28,223 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:04:28,223 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:04:28,223 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:04:28,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:04:28,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:04:28,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:04:28,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:04:28,294 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:04:28,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-14 16:04:28,369 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3751a16ed/d9cb4420201141f6a3eb8c7ce9de03ee/FLAG3f6875e16 [2018-11-14 16:04:28,932 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:04:28,932 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-14 16:04:28,940 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3751a16ed/d9cb4420201141f6a3eb8c7ce9de03ee/FLAG3f6875e16 [2018-11-14 16:04:28,956 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3751a16ed/d9cb4420201141f6a3eb8c7ce9de03ee [2018-11-14 16:04:28,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:04:28,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:04:28,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:04:28,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:04:28,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:04:28,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:04:28" (1/1) ... [2018-11-14 16:04:28,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e166c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:28, skipping insertion in model container [2018-11-14 16:04:28,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:04:28" (1/1) ... [2018-11-14 16:04:28,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:04:29,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:04:29,239 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:04:29,255 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:04:29,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:04:29,308 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:04:29,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29 WrapperNode [2018-11-14 16:04:29,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:04:29,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:04:29,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:04:29,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:04:29,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (1/1) ... [2018-11-14 16:04:29,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:04:29,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:04:29,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:04:29,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:04:29,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04: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-14 16:04:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:04:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:04:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-14 16:04:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:04:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:04:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:04:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:04:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:04:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:04:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:04:30,274 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:04:30,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:04:30 BoogieIcfgContainer [2018-11-14 16:04:30,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:04:30,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:04:30,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:04:30,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:04:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:04:28" (1/3) ... [2018-11-14 16:04:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cef41df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:04:30, skipping insertion in model container [2018-11-14 16:04:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:29" (2/3) ... [2018-11-14 16:04:30,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cef41df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:04:30, skipping insertion in model container [2018-11-14 16:04:30,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:04:30" (3/3) ... [2018-11-14 16:04:30,285 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-14 16:04:30,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:04:30,305 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:04:30,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:04:30,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:04:30,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:04:30,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:04:30,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:04:30,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:04:30,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:04:30,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:04:30,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:04:30,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:04:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 16:04:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:04:30,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:30,404 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:30,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -451853065, now seen corresponding path program 1 times [2018-11-14 16:04:30,418 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:30,419 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-14 16:04:30,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:30,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:30,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 16:04:30,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {36#true} is VALID [2018-11-14 16:04:30,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 16:04:30,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 16:04:30,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 16:04:30,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2018-11-14 16:04:30,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 16:04:30,824 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 16:04:30,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {36#true} is VALID [2018-11-14 16:04:30,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 16:04:30,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:04:30,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:04:30,828 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 16:04:30,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {37#false} is VALID [2018-11-14 16:04:30,829 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 16:04:30,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-14 16:04:30,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:04:30,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:04:30,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:04:30,830 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #68#return; {37#false} is VALID [2018-11-14 16:04:30,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {37#false} is VALID [2018-11-14 16:04:30,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:04:30,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {37#false} is VALID [2018-11-14 16:04:30,832 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 16:04:30,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-14 16:04:30,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:04:30,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:04:30,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:04:30,833 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #70#return; {37#false} is VALID [2018-11-14 16:04:30,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {37#false} is VALID [2018-11-14 16:04:30,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-14 16:04:30,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 16:04:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-14 16:04:30,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:04:30,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:04:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:04:30,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:04:30,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:30,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:04:31,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:31,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:04:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:04:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:04:31,051 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 16:04:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:31,311 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 16:04:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:04:31,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:04:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:04:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:04:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:04:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:04:31,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 16:04:31,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:31,572 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:04:31,573 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:04:31,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:04:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:04:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 16:04:31,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:31,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 16:04:31,690 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:04:31,690 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:04:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:31,697 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:04:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:04:31,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:31,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:31,698 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:04:31,699 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:04:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:31,704 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:04:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:04:31,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:31,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:31,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:31,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:04:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 16:04:31,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 32 [2018-11-14 16:04:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:31,712 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 16:04:31,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:04:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:04:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 16:04:31,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:31,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:31,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:31,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1864375029, now seen corresponding path program 1 times [2018-11-14 16:04:31,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:31,717 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-14 16:04:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:31,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:32,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 16:04:32,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {297#true} is VALID [2018-11-14 16:04:32,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 16:04:32,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 16:04:32,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret11 := main(); {297#true} is VALID [2018-11-14 16:04:32,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {297#true} is VALID [2018-11-14 16:04:32,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:32,598 INFO L256 TraceCheckUtils]: 7: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:32,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {327#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:32,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {327#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {327#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:32,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {327#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:04:32,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:04:32,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,602 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {298#false} {320#(bvsgt ~N~0 (_ bv1 32))} #66#return; {298#false} is VALID [2018-11-14 16:04:32,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {298#false} is VALID [2018-11-14 16:04:32,603 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 16:04:32,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-14 16:04:32,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:04:32,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:04:32,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,605 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {298#false} {298#false} #68#return; {298#false} is VALID [2018-11-14 16:04:32,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {298#false} is VALID [2018-11-14 16:04:32,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {298#false} is VALID [2018-11-14 16:04:32,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {298#false} is VALID [2018-11-14 16:04:32,607 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 16:04:32,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-14 16:04:32,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:04:32,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:04:32,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:04:32,609 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {298#false} {298#false} #70#return; {298#false} is VALID [2018-11-14 16:04:32,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-14 16:04:32,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-14 16:04:32,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 16:04:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:04:32,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:04:32,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:04:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:04:32,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 16:04:32,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:32,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:04:32,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:32,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:04:32,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:04:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:04:32,733 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-14 16:04:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:33,235 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 16:04:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:04:33,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 16:04:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:04:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 16:04:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:04:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 16:04:33,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-14 16:04:33,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:33,430 INFO L225 Difference]: With dead ends: 49 [2018-11-14 16:04:33,431 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 16:04:33,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:04:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 16:04:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 16:04:33,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:33,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 16:04:33,518 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 16:04:33,518 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 16:04:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:33,522 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:04:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:04:33,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:33,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:33,524 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 16:04:33,524 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 16:04:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:33,528 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:04:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:04:33,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:33,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:33,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:33,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:04:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 16:04:33,533 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 36 [2018-11-14 16:04:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:33,533 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 16:04:33,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:04:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:04:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:04:33,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:33,535 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:33,536 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:33,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -23086158, now seen corresponding path program 1 times [2018-11-14 16:04:33,537 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:33,537 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-14 16:04:33,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:33,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:33,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 16:04:33,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {573#true} is VALID [2018-11-14 16:04:33,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:33,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 16:04:33,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 16:04:33,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 16:04:33,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:33,815 INFO L256 TraceCheckUtils]: 7: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:33,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:33,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:33,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:33,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {613#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:33,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {613#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:33,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:04:33,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:04:33,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,826 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {574#false} {596#(bvsgt ~N~0 (_ bv1 32))} #66#return; {574#false} is VALID [2018-11-14 16:04:33,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {574#false} is VALID [2018-11-14 16:04:33,827 INFO L256 TraceCheckUtils]: 18: Hoare triple {574#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {574#false} is VALID [2018-11-14 16:04:33,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {574#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {574#false} is VALID [2018-11-14 16:04:33,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {574#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {574#false} is VALID [2018-11-14 16:04:33,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {574#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {574#false} is VALID [2018-11-14 16:04:33,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:04:33,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:04:33,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,830 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {574#false} {574#false} #68#return; {574#false} is VALID [2018-11-14 16:04:33,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {574#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {574#false} is VALID [2018-11-14 16:04:33,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,831 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 16:04:33,832 INFO L273 TraceCheckUtils]: 31: Hoare triple {574#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {574#false} is VALID [2018-11-14 16:04:33,832 INFO L256 TraceCheckUtils]: 32: Hoare triple {574#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {574#false} is VALID [2018-11-14 16:04:33,832 INFO L273 TraceCheckUtils]: 33: Hoare triple {574#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {574#false} is VALID [2018-11-14 16:04:33,832 INFO L273 TraceCheckUtils]: 34: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {574#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {574#false} is VALID [2018-11-14 16:04:33,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {574#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {574#false} is VALID [2018-11-14 16:04:33,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:04:33,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:04:33,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:33,835 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {574#false} {574#false} #70#return; {574#false} is VALID [2018-11-14 16:04:33,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 16:04:33,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 16:04:33,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 16:04:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 16:04:33,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:34,172 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 16:04:34,172 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 16:04:34,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 16:04:34,173 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {573#true} {574#false} #70#return; {574#false} is VALID [2018-11-14 16:04:34,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 16:04:34,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 16:04:34,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {573#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {573#true} is VALID [2018-11-14 16:04:34,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {573#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {573#true} is VALID [2018-11-14 16:04:34,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {573#true} is VALID [2018-11-14 16:04:34,176 INFO L256 TraceCheckUtils]: 32: Hoare triple {574#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:04:34,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {574#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {574#false} is VALID [2018-11-14 16:04:34,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 16:04:34,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:04:34,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {574#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {574#false} is VALID [2018-11-14 16:04:34,177 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {573#true} {574#false} #68#return; {574#false} is VALID [2018-11-14 16:04:34,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 16:04:34,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 16:04:34,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {573#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {573#true} is VALID [2018-11-14 16:04:34,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {573#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {573#true} is VALID [2018-11-14 16:04:34,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {573#true} is VALID [2018-11-14 16:04:34,180 INFO L256 TraceCheckUtils]: 18: Hoare triple {574#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:04:34,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {574#false} is VALID [2018-11-14 16:04:34,196 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#(not (bvsgt ~N~0 (_ bv1 32)))} {596#(bvsgt ~N~0 (_ bv1 32))} #66#return; {574#false} is VALID [2018-11-14 16:04:34,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:34,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:34,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:34,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {810#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume true; {810#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:04:34,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {810#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:04:34,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:04:34,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume true; {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:04:34,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {817#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:04:34,247 INFO L256 TraceCheckUtils]: 7: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:04:34,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:34,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 16:04:34,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 16:04:34,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 16:04:34,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:04:34,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {573#true} is VALID [2018-11-14 16:04:34,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 16:04:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-14 16:04:34,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:34,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-14 16:04:34,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:04:34,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:34,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:04:34,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:04:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:04:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:04:34,424 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-14 16:04:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:35,130 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 16:04:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:04:35,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:04:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:04:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:04:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:04:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:04:35,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-14 16:04:35,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:35,318 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:04:35,318 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 16:04:35,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:04:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 16:04:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-14 16:04:35,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:35,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-14 16:04:35,342 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-14 16:04:35,342 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-14 16:04:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:35,346 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 16:04:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 16:04:35,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:35,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:35,348 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-14 16:04:35,348 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-14 16:04:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:35,351 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 16:04:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 16:04:35,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:35,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:35,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:35,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:04:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 16:04:35,357 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2018-11-14 16:04:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:35,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 16:04:35,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:04:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:04:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:04:35,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:35,360 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:35,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:35,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1557143659, now seen corresponding path program 2 times [2018-11-14 16:04:35,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:35,361 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-14 16:04:35,381 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:04:35,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:04:35,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:04:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:35,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:35,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 16:04:35,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:04:35,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:35,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 16:04:35,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 16:04:35,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 16:04:35,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1057#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:35,827 INFO L256 TraceCheckUtils]: 7: Hoare triple {1057#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {1057#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:35,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {1057#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {1064#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1084#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1084#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,852 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1057#(bvsgt ~N~0 (_ bv1 32))} #66#return; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,858 INFO L256 TraceCheckUtils]: 21: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,869 INFO L273 TraceCheckUtils]: 24: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,879 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #68#return; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:35,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-14 16:04:35,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume true; {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-14 16:04:35,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1035#false} is VALID [2018-11-14 16:04:35,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {1035#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1035#false} is VALID [2018-11-14 16:04:35,890 INFO L256 TraceCheckUtils]: 38: Hoare triple {1035#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {1035#false} is VALID [2018-11-14 16:04:35,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {1035#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1035#false} is VALID [2018-11-14 16:04:35,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:04:35,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {1035#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1035#false} is VALID [2018-11-14 16:04:35,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {1035#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1035#false} is VALID [2018-11-14 16:04:35,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:04:35,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {1035#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1035#false} is VALID [2018-11-14 16:04:35,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {1035#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1035#false} is VALID [2018-11-14 16:04:35,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:04:35,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {1035#false} assume !~bvslt32(~i~0, ~N~0); {1035#false} is VALID [2018-11-14 16:04:35,893 INFO L273 TraceCheckUtils]: 48: Hoare triple {1035#false} #res := ~ret~0[32:0]; {1035#false} is VALID [2018-11-14 16:04:35,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:04:35,893 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1035#false} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 16:04:35,893 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 16:04:35,894 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 16:04:35,894 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 16:04:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 53 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 16:04:35,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:36,295 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 16:04:36,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 16:04:36,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 16:04:36,296 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1034#true} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 16:04:36,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:04:36,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:04:36,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,300 INFO L273 TraceCheckUtils]: 39: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:04:36,300 INFO L256 TraceCheckUtils]: 38: Hoare triple {1035#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:04:36,301 INFO L273 TraceCheckUtils]: 37: Hoare triple {1035#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1035#false} is VALID [2018-11-14 16:04:36,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1035#false} is VALID [2018-11-14 16:04:36,331 INFO L273 TraceCheckUtils]: 35: Hoare triple {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume true; {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,362 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1034#true} {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #68#return; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:04:36,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:04:36,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:04:36,367 INFO L256 TraceCheckUtils]: 21: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:04:36,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,385 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1034#true} {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #66#return; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:04:36,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:04:36,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:04:36,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:04:36,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:04:36,388 INFO L256 TraceCheckUtils]: 7: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:04:36,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:04:36,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 16:04:36,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 16:04:36,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 16:04:36,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:04:36,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:04:36,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 16:04:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-14 16:04:36,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:04:36,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-14 16:04:36,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 16:04:36,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:36,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:04:36,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:04:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:04:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:04:36,555 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2018-11-14 16:04:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:37,884 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-14 16:04:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:04:37,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 16:04:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:04:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 16:04:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:04:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 16:04:37,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-14 16:04:38,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:38,106 INFO L225 Difference]: With dead ends: 87 [2018-11-14 16:04:38,106 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 16:04:38,107 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:04:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 16:04:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-14 16:04:38,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:38,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 59 states. [2018-11-14 16:04:38,162 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 59 states. [2018-11-14 16:04:38,162 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 59 states. [2018-11-14 16:04:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:38,166 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 16:04:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 16:04:38,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:38,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:38,168 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 65 states. [2018-11-14 16:04:38,168 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 65 states. [2018-11-14 16:04:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:38,177 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 16:04:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 16:04:38,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:38,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:38,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:38,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:04:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-11-14 16:04:38,184 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 54 [2018-11-14 16:04:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:38,184 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-14 16:04:38,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:04:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-14 16:04:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:04:38,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:38,187 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:38,187 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:38,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -864027724, now seen corresponding path program 1 times [2018-11-14 16:04:38,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:38,188 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-14 16:04:38,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:04:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:39,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:40,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-14 16:04:40,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:40,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-14 16:04:40,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:40,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-14 16:04:40,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:40,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:40,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:40,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:40,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:57, output treesize:31 [2018-11-14 16:04:41,168 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-14 16:04:41,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 50 [2018-11-14 16:04:41,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:41,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-14 16:04:41,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:41,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:41,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:41,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2018-11-14 16:04:41,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:42,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2018-11-14 16:04:42,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:42,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:42,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:04:42,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-11-14 16:04:42,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:42,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:42,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:04:42,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:57 [2018-11-14 16:04:42,363 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:43,030 INFO L477 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 63 treesize of output 51 [2018-11-14 16:04:43,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:04:43,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-14 16:04:43,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:04:43,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:04:43,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:04:43,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:31 [2018-11-14 16:04:43,143 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:43,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2018-11-14 16:04:43,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {1703#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1703#true} is VALID [2018-11-14 16:04:43,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1703#true} assume true; {1703#true} is VALID [2018-11-14 16:04:43,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1703#true} {1703#true} #62#return; {1703#true} is VALID [2018-11-14 16:04:43,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1703#true} call #t~ret11 := main(); {1703#true} is VALID [2018-11-14 16:04:43,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {1703#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1703#true} is VALID [2018-11-14 16:04:43,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {1703#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,424 INFO L256 TraceCheckUtils]: 7: Hoare triple {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {1730#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:04:43,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {1730#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1734#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume true; {1734#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1741#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {1741#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1745#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {1745#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume true; {1745#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {1745#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1752#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset|))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {1752#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset|))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1756#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {1756#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1756#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {1756#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #res := ~ret~0[32:0]; {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-14 16:04:43,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} assume true; {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-14 16:04:43,643 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {1774#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {1774#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,693 INFO L256 TraceCheckUtils]: 21: Hoare triple {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {1782#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {1782#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1786#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {1786#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume true; {1786#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {1786#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1793#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {1793#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1797#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {1797#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume true; {1797#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {1797#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} assume true; {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} assume !~bvslt32(~i~0, ~N~0); {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {1763#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #res := ~ret~0[32:0]; {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-14 16:04:43,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} assume true; {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-14 16:04:43,861 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1767#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} #68#return; {1822#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret6|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {1822#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret6|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-14 16:04:43,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume true; {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-14 16:04:43,920 INFO L273 TraceCheckUtils]: 36: Hoare triple {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem9, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem9; {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} #t~post8 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:43,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {1833#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:04:43,971 INFO L256 TraceCheckUtils]: 41: Hoare triple {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {1703#true} is VALID [2018-11-14 16:04:43,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {1703#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1853#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {1853#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume true; {1853#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-14 16:04:43,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {1853#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1860#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base))} is VALID [2018-11-14 16:04:43,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {1860#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1864#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:43,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {1864#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume true; {1864#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-14 16:04:44,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {1864#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-14 16:04:44,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-14 16:04:44,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} assume true; {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-14 16:04:44,050 INFO L273 TraceCheckUtils]: 50: Hoare triple {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} assume !~bvslt32(~i~0, ~N~0); {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-14 16:04:44,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {1871#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} #res := ~ret~0[32:0]; {1884#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} is VALID [2018-11-14 16:04:44,099 INFO L273 TraceCheckUtils]: 52: Hoare triple {1884#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} assume true; {1884#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} is VALID [2018-11-14 16:04:44,151 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1884#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} #70#return; {1891#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret10|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1)))} is VALID [2018-11-14 16:04:44,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {1891#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret10|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1)))} ~ret5~0 := #t~ret10;havoc #t~ret10; {1895#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret5~0)))} is VALID [2018-11-14 16:04:44,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {1895#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret5~0)))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1704#false} is VALID [2018-11-14 16:04:44,155 INFO L273 TraceCheckUtils]: 56: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2018-11-14 16:04:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 6 proven. 92 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:04:44,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:00,395 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-14 16:05:01,404 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-14 16:05:02,331 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-14 16:05:03,787 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-14 16:05:04,801 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 16:05:07,618 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-14 16:05:07,725 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:05:08,235 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:05:08,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:08,498 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-11-14 16:05:08,499 INFO L477 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 147 treesize of output 115 [2018-11-14 16:05:08,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:09,146 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:09,147 INFO L303 Elim1Store]: Index analysis took 644 ms [2018-11-14 16:05:09,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 96 [2018-11-14 16:05:09,754 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-14 16:05:09,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:09,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:09,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2018-11-14 16:05:09,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-11-14 16:05:10,480 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-14 16:05:10,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:10,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-11-14 16:05:10,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:10,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:10,522 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:10,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:10,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:10,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:10,554 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:14 [2018-11-14 16:05:10,599 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:13,520 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:05:16,926 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-14 16:05:18,939 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-14 16:05:19,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 141 [2018-11-14 16:05:19,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:19,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 111 [2018-11-14 16:05:19,251 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:19,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-11-14 16:05:19,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:19,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-11-14 16:05:20,283 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-14 16:05:20,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:20,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 64 [2018-11-14 16:05:20,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:20,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 71 [2018-11-14 16:05:20,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,347 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:05:20,348 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,352 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:05:20,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,356 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:05:20,357 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,392 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:05:20,405 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,427 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:20,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-14 16:05:20,436 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:20,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:20,553 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-14 16:05:20,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:20,780 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:20,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:20,873 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-11-14 16:05:21,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 133 treesize of output 172 [2018-11-14 16:05:24,004 WARN L179 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 226 DAG size of output: 205 [2018-11-14 16:05:24,090 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 171 [2018-11-14 16:05:24,337 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,338 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,338 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:24,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 142 [2018-11-14 16:05:26,288 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-11-14 16:05:26,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-11-14 16:05:26,376 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:26,444 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:26,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:26,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 132 [2018-11-14 16:05:30,822 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 62 [2018-11-14 16:05:30,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 101 [2018-11-14 16:05:30,889 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:05:31,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,088 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 74 [2018-11-14 16:05:31,099 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:31,147 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:31,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,448 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,453 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:31,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 137 [2018-11-14 16:05:33,087 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2018-11-14 16:05:33,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,142 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,142 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,148 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 87 [2018-11-14 16:05:33,191 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:33,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,402 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,402 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 104 [2018-11-14 16:05:33,422 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:33,559 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-14 16:05:33,695 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-14 16:05:35,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:35,313 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:35,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 130 [2018-11-14 16:05:35,542 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:35,543 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:35,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:35,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 160 [2018-11-14 16:05:38,085 WARN L179 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 109 [2018-11-14 16:05:38,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 108 [2018-11-14 16:05:38,166 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:38,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 91 [2018-11-14 16:05:38,574 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:38,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,950 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:38,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-14 16:05:38,959 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:39,238 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:05:39,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 100 [2018-11-14 16:05:39,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2018-11-14 16:05:39,705 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:39,722 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:39,816 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:05:57,227 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:57,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:57,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:57,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 167 [2018-11-14 16:05:57,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:57,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:57,792 INFO L303 Elim1Store]: Index analysis took 170 ms [2018-11-14 16:05:57,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 137 [2018-11-14 16:05:59,913 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2018-11-14 16:05:59,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:59,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:59,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:59,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-14 16:05:59,991 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:00,067 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:00,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:00,415 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:00,415 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:00,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 132 [2018-11-14 16:06:02,268 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-11-14 16:06:02,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,285 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,285 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 73 [2018-11-14 16:06:02,334 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:06:02,470 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:06:02,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,912 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:02,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 137 [2018-11-14 16:06:03,672 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2018-11-14 16:06:03,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:03,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:03,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:03,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:03,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2018-11-14 16:06:03,761 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:03,868 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:04,128 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-14 16:06:05,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:05,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:05,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:05,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 144 [2018-11-14 16:06:05,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:05,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:05,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 116 [2018-11-14 16:06:06,003 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-11-14 16:06:06,062 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:06,063 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:06,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 87 [2018-11-14 16:06:06,142 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:06,191 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:06,191 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:06,257 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,257 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2018-11-14 16:06:06,269 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:06,320 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:06,320 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:06,358 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:06,379 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:06,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-14 16:06:06,517 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:06,626 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-14 16:06:06,763 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-14 16:06:08,908 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:08,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:08,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:08,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 126 [2018-11-14 16:06:08,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:08,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:09,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 104 [2018-11-14 16:06:10,052 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-11-14 16:06:10,107 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:10,108 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:10,162 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,163 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-11-14 16:06:10,185 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:10,237 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:10,238 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:10,242 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:06:10,243 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:10,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 63 [2018-11-14 16:06:10,311 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:10,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,365 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2018-11-14 16:06:10,383 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:10,429 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,430 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:10,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-11-14 16:06:10,448 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:06:10,601 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-14 16:06:10,748 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-14 16:06:13,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:13,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:13,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 126 [2018-11-14 16:06:13,908 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:13,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:14,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 106 [2018-11-14 16:06:14,186 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-11-14 16:06:14,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:14,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:14,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-11-14 16:06:14,287 INFO L267 ElimStorePlain]: Start of recursive call 57: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-14 16:06:14,372 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.