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/array-examples/standard_copyInitSum2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:50:57,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:50:57,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:50:57,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:50:57,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:50:57,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:50:57,090 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:50:57,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:50:57,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:50:57,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:50:57,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:50:57,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:50:57,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:50:57,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:50:57,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:50:57,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:50:57,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:50:57,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:50:57,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:50:57,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:50:57,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:50:57,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:50:57,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:50:57,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:50:57,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:50:57,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:50:57,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:50:57,136 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:50:57,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:50:57,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:50:57,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:50:57,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:50:57,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:50:57,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:50:57,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:50:57,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:50:57,146 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 15:50:57,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:50:57,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:50:57,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:50:57,176 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:50:57,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:50:57,177 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:50:57,177 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:50:57,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:50:57,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:50:57,179 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:50:57,179 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:50:57,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:50:57,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:50:57,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:50:57,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:50:57,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:50:57,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:50:57,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:50:57,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:50:57,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:50:57,181 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:50:57,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:50:57,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:50:57,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:50:57,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:50:57,270 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:50:57,271 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:50:57,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 15:50:57,344 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c9e5812/ae69992287884e81b3419783aea516ff/FLAG68153674f [2018-11-14 15:50:57,854 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:50:57,854 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 15:50:57,860 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c9e5812/ae69992287884e81b3419783aea516ff/FLAG68153674f [2018-11-14 15:50:57,876 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c9e5812/ae69992287884e81b3419783aea516ff [2018-11-14 15:50:57,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:50:57,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:50:57,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:50:57,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:50:57,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:50:57,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:50:57" (1/1) ... [2018-11-14 15:50:57,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55907750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:57, skipping insertion in model container [2018-11-14 15:50:57,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:50:57" (1/1) ... [2018-11-14 15:50:57,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:50:57,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:50:58,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:50:58,154 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:50:58,192 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:50:58,215 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:50:58,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58 WrapperNode [2018-11-14 15:50:58,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:50:58,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:50:58,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:50:58,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:50:58,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (1/1) ... [2018-11-14 15:50:58,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:50:58,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:50:58,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:50:58,265 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:50:58,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (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 15:50:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:50:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:50:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:50:58,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:50:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:50:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:50:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:50:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:50:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:50:59,058 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:50:59,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:50:59 BoogieIcfgContainer [2018-11-14 15:50:59,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:50:59,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:50:59,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:50:59,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:50:59,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:50:57" (1/3) ... [2018-11-14 15:50:59,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d92bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:50:59, skipping insertion in model container [2018-11-14 15:50:59,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:50:58" (2/3) ... [2018-11-14 15:50:59,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d92bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:50:59, skipping insertion in model container [2018-11-14 15:50:59,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:50:59" (3/3) ... [2018-11-14 15:50:59,068 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 15:50:59,076 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:50:59,084 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:50:59,098 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:50:59,131 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:50:59,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:50:59,132 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:50:59,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:50:59,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:50:59,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:50:59,132 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:50:59,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:50:59,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:50:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 15:50:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 15:50:59,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:50:59,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:50:59,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:50:59,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:50:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -422982541, now seen corresponding path program 1 times [2018-11-14 15:50:59,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:50:59,175 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 15:50:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:50:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:50:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:50:59,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:50:59,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 15:50:59,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-14 15:50:59,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 15:50:59,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2018-11-14 15:50:59,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2018-11-14 15:50:59,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {36#true} is VALID [2018-11-14 15:50:59,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 15:50:59,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-14 15:50:59,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 15:50:59,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-14 15:50:59,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 15:50:59,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} havoc ~x~0;~x~0 := 0bv32; {37#false} is VALID [2018-11-14 15:50:59,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 15:50:59,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {37#false} is VALID [2018-11-14 15:50:59,420 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {37#false} is VALID [2018-11-14 15:50:59,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 15:50:59,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume ~cond == 0bv32; {37#false} is VALID [2018-11-14 15:50:59,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 15:50:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:50:59,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 15:50:59,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:50:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:50:59,442 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 15:50:59,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:50:59,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:50:59,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:50:59,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:50:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:50:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:50:59,553 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 15:50:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:50:59,926 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 15:50:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:50:59,928 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 15:50:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:50:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:50:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 15:50:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:50:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 15:50:59,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 15:51:00,315 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 15:51:00,327 INFO L225 Difference]: With dead ends: 58 [2018-11-14 15:51:00,328 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 15:51:00,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 15:51:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 15:51:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 15:51:00,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:51:00,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 15:51:00,407 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 15:51:00,407 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 15:51:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:00,412 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 15:51:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 15:51:00,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:00,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:00,413 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 15:51:00,413 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 15:51:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:00,418 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 15:51:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 15:51:00,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:00,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:00,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:51:00,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:51:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 15:51:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 15:51:00,430 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2018-11-14 15:51:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:51:00,430 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 15:51:00,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:51:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 15:51:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 15:51:00,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:51:00,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:51:00,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:51:00,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:51:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1279953697, now seen corresponding path program 1 times [2018-11-14 15:51:00,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:51:00,435 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 15:51:00,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:51:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:00,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:51:00,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2018-11-14 15:51:00,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {258#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {258#true} is VALID [2018-11-14 15:51:00,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2018-11-14 15:51:00,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #80#return; {258#true} is VALID [2018-11-14 15:51:00,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret6 := main(); {258#true} is VALID [2018-11-14 15:51:00,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {278#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:00,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {278#(= main_~i~0 (_ bv0 32))} assume true; {278#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:00,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {259#false} is VALID [2018-11-14 15:51:00,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {259#false} ~i~0 := 0bv32; {259#false} is VALID [2018-11-14 15:51:00,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {259#false} assume true; {259#false} is VALID [2018-11-14 15:51:00,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {259#false} assume !~bvslt32(~i~0, 100000bv32); {259#false} is VALID [2018-11-14 15:51:00,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {259#false} ~i~0 := 0bv32; {259#false} is VALID [2018-11-14 15:51:00,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {259#false} assume true; {259#false} is VALID [2018-11-14 15:51:00,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {259#false} assume !~bvslt32(~i~0, 100000bv32); {259#false} is VALID [2018-11-14 15:51:00,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {259#false} havoc ~x~0;~x~0 := 0bv32; {259#false} is VALID [2018-11-14 15:51:00,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {259#false} assume true; {259#false} is VALID [2018-11-14 15:51:00,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {259#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {259#false} is VALID [2018-11-14 15:51:00,583 INFO L256 TraceCheckUtils]: 17: Hoare triple {259#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {259#false} is VALID [2018-11-14 15:51:00,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2018-11-14 15:51:00,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {259#false} assume ~cond == 0bv32; {259#false} is VALID [2018-11-14 15:51:00,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {259#false} assume !false; {259#false} is VALID [2018-11-14 15:51:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:51:00,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:51:00,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:51:00,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:51:00,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 15:51:00,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:51:00,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:51:00,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:00,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:51:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:51:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:51:00,852 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-14 15:51:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:01,197 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-14 15:51:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:51:01,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 15:51:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:51:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:51:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 15:51:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:51:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 15:51:01,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-14 15:51:01,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:01,382 INFO L225 Difference]: With dead ends: 56 [2018-11-14 15:51:01,382 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 15:51:01,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:51:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 15:51:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-14 15:51:01,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:51:01,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-14 15:51:01,406 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-14 15:51:01,406 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-14 15:51:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:01,410 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 15:51:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-14 15:51:01,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:01,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:01,411 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-14 15:51:01,412 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-14 15:51:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:01,415 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 15:51:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-14 15:51:01,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:01,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:01,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:51:01,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:51:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 15:51:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 15:51:01,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2018-11-14 15:51:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:51:01,419 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 15:51:01,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:51:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 15:51:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 15:51:01,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:51:01,421 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:51:01,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:51:01,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:51:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 417422168, now seen corresponding path program 1 times [2018-11-14 15:51:01,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:51:01,423 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 15:51:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:51:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:01,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:51:01,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-14 15:51:01,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {516#true} is VALID [2018-11-14 15:51:01,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-14 15:51:01,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #80#return; {516#true} is VALID [2018-11-14 15:51:01,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret6 := main(); {516#true} is VALID [2018-11-14 15:51:01,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {516#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {536#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:01,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(= main_~i~0 (_ bv0 32))} assume true; {536#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:01,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {543#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:01,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {543#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {543#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:01,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#false} ~i~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {517#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {517#false} is VALID [2018-11-14 15:51:01,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {517#false} is VALID [2018-11-14 15:51:01,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {517#false} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} ~i~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {517#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {517#false} is VALID [2018-11-14 15:51:01,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {517#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {517#false} is VALID [2018-11-14 15:51:01,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {517#false} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {517#false} havoc ~x~0;~x~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {517#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {517#false} is VALID [2018-11-14 15:51:01,686 INFO L256 TraceCheckUtils]: 25: Hoare triple {517#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {517#false} is VALID [2018-11-14 15:51:01,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {517#false} ~cond := #in~cond; {517#false} is VALID [2018-11-14 15:51:01,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {517#false} assume ~cond == 0bv32; {517#false} is VALID [2018-11-14 15:51:01,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-14 15:51:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 15:51:01,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:51:01,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-14 15:51:01,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {517#false} assume ~cond == 0bv32; {517#false} is VALID [2018-11-14 15:51:01,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {517#false} ~cond := #in~cond; {517#false} is VALID [2018-11-14 15:51:01,795 INFO L256 TraceCheckUtils]: 25: Hoare triple {517#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {517#false} is VALID [2018-11-14 15:51:01,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {517#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {517#false} is VALID [2018-11-14 15:51:01,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {517#false} havoc ~x~0;~x~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {517#false} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {517#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {517#false} is VALID [2018-11-14 15:51:01,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {517#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {517#false} is VALID [2018-11-14 15:51:01,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} ~i~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {517#false} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {517#false} is VALID [2018-11-14 15:51:01,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {517#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {517#false} is VALID [2018-11-14 15:51:01,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#false} assume true; {517#false} is VALID [2018-11-14 15:51:01,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#false} ~i~0 := 0bv32; {517#false} is VALID [2018-11-14 15:51:01,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {664#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {517#false} is VALID [2018-11-14 15:51:01,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {664#(bvslt main_~i~0 (_ bv100000 32))} assume true; {664#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:01,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {664#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:01,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {671#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {671#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:01,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {516#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {671#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:01,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret6 := main(); {516#true} is VALID [2018-11-14 15:51:01,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #80#return; {516#true} is VALID [2018-11-14 15:51:01,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-14 15:51:01,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {516#true} is VALID [2018-11-14 15:51:01,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-14 15:51:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 15:51:01,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:51:01,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:51:01,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 15:51:01,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:51:01,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:51:01,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:51:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:51:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:51:01,908 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-14 15:51:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:02,631 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-14 15:51:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:51:02,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 15:51:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:51:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:51:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-14 15:51:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:51:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-14 15:51:02,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2018-11-14 15:51:02,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:02,808 INFO L225 Difference]: With dead ends: 82 [2018-11-14 15:51:02,808 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 15:51:02,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:51:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 15:51:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 15:51:02,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:51:02,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 15:51:02,853 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 15:51:02,853 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 15:51:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:02,856 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-14 15:51:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 15:51:02,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:02,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:02,858 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 15:51:02,858 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 15:51:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:02,862 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-14 15:51:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 15:51:02,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:02,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:02,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:51:02,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:51:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 15:51:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-14 15:51:02,867 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 29 [2018-11-14 15:51:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:51:02,867 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-14 15:51:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:51:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 15:51:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 15:51:02,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:51:02,869 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:51:02,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:51:02,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:51:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1058860745, now seen corresponding path program 2 times [2018-11-14 15:51:02,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:51:02,871 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 15:51:02,902 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:51:02,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:51:02,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:51:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:03,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:51:03,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {1004#true} call ULTIMATE.init(); {1004#true} is VALID [2018-11-14 15:51:03,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {1004#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1004#true} is VALID [2018-11-14 15:51:03,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {1004#true} assume true; {1004#true} is VALID [2018-11-14 15:51:03,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1004#true} {1004#true} #80#return; {1004#true} is VALID [2018-11-14 15:51:03,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {1004#true} call #t~ret6 := main(); {1004#true} is VALID [2018-11-14 15:51:03,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {1004#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1024#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:03,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {1024#(= main_~i~0 (_ bv0 32))} assume true; {1024#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:03,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {1024#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1031#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1031#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1031#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {1031#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1038#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:03,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {1038#(= (_ bv2 32) main_~i~0)} assume true; {1038#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:03,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {1038#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1045#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1045#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {1045#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1052#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {1052#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1052#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:03,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {1052#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {1005#false} ~i~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {1005#false} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {1005#false} ~i~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {1005#false} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {1005#false} havoc ~x~0;~x~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {1005#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1005#false} is VALID [2018-11-14 15:51:03,237 INFO L256 TraceCheckUtils]: 49: Hoare triple {1005#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1005#false} is VALID [2018-11-14 15:51:03,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {1005#false} ~cond := #in~cond; {1005#false} is VALID [2018-11-14 15:51:03,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {1005#false} assume ~cond == 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2018-11-14 15:51:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 15:51:03,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:51:03,522 INFO L273 TraceCheckUtils]: 52: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2018-11-14 15:51:03,523 INFO L273 TraceCheckUtils]: 51: Hoare triple {1005#false} assume ~cond == 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,524 INFO L273 TraceCheckUtils]: 50: Hoare triple {1005#false} ~cond := #in~cond; {1005#false} is VALID [2018-11-14 15:51:03,524 INFO L256 TraceCheckUtils]: 49: Hoare triple {1005#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1005#false} is VALID [2018-11-14 15:51:03,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {1005#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1005#false} is VALID [2018-11-14 15:51:03,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {1005#false} havoc ~x~0;~x~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {1005#false} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,527 INFO L273 TraceCheckUtils]: 42: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,527 INFO L273 TraceCheckUtils]: 41: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {1005#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1005#false} is VALID [2018-11-14 15:51:03,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1005#false} is VALID [2018-11-14 15:51:03,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {1005#false} ~i~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {1005#false} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {1005#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#false} is VALID [2018-11-14 15:51:03,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {1005#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1005#false} is VALID [2018-11-14 15:51:03,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-14 15:51:03,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {1005#false} ~i~0 := 0bv32; {1005#false} is VALID [2018-11-14 15:51:03,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {1281#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1005#false} is VALID [2018-11-14 15:51:03,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {1281#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1281#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:03,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1281#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:03,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1288#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {1295#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1288#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {1295#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1295#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {1302#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1295#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {1302#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1302#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {1309#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1302#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {1309#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1309#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {1004#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1309#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:03,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {1004#true} call #t~ret6 := main(); {1004#true} is VALID [2018-11-14 15:51:03,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1004#true} {1004#true} #80#return; {1004#true} is VALID [2018-11-14 15:51:03,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {1004#true} assume true; {1004#true} is VALID [2018-11-14 15:51:03,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {1004#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1004#true} is VALID [2018-11-14 15:51:03,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1004#true} call ULTIMATE.init(); {1004#true} is VALID [2018-11-14 15:51:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 15:51:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:51:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:51:03,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 15:51:03,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:51:03,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:51:03,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:51:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:51:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:51:03,685 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 12 states. [2018-11-14 15:51:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:05,722 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-11-14 15:51:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:51:05,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 15:51:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:51:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:51:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2018-11-14 15:51:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:51:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2018-11-14 15:51:05,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2018-11-14 15:51:06,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:06,099 INFO L225 Difference]: With dead ends: 148 [2018-11-14 15:51:06,100 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 15:51:06,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 15:51:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 15:51:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-14 15:51:06,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:51:06,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-14 15:51:06,230 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-14 15:51:06,230 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-14 15:51:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:06,234 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-14 15:51:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-14 15:51:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:06,239 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-14 15:51:06,239 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-14 15:51:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:06,244 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-14 15:51:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-14 15:51:06,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:06,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:06,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:51:06,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:51:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-14 15:51:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-11-14 15:51:06,250 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 53 [2018-11-14 15:51:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:51:06,250 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-11-14 15:51:06,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:51:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-14 15:51:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-14 15:51:06,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:51:06,254 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:51:06,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:51:06,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:51:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1060537157, now seen corresponding path program 3 times [2018-11-14 15:51:06,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:51:06,256 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 15:51:06,272 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:51:08,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 15:51:08,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:51:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:09,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:51:09,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1900#true} is VALID [2018-11-14 15:51:09,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1900#true} is VALID [2018-11-14 15:51:09,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #80#return; {1900#true} is VALID [2018-11-14 15:51:09,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret6 := main(); {1900#true} is VALID [2018-11-14 15:51:09,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1900#true} is VALID [2018-11-14 15:51:09,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:09,326 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:09,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#true} assume !~bvslt32(~i~0, 100000bv32); {1900#true} is VALID [2018-11-14 15:51:09,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#true} ~i~0 := 0bv32; {1989#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:09,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {1989#(= main_~i~0 (_ bv0 32))} assume true; {1989#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:09,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {1989#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1989#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:09,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {1999#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2009#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:09,340 INFO L273 TraceCheckUtils]: 35: Hoare triple {2009#(= (_ bv2 32) main_~i~0)} assume true; {2009#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:09,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {2009#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2009#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:09,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {2009#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,345 INFO L273 TraceCheckUtils]: 39: Hoare triple {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {2019#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2029#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:51:09,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {2029#(= (_ bv4 32) main_~i~0)} assume true; {2029#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:51:09,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {2029#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2029#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:51:09,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {2029#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {2039#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2049#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:51:09,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {2049#(= (_ bv6 32) main_~i~0)} assume true; {2049#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:51:09,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {2049#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2049#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:51:09,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {2049#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,352 INFO L273 TraceCheckUtils]: 50: Hoare triple {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,359 INFO L273 TraceCheckUtils]: 52: Hoare triple {2059#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2069#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:51:09,362 INFO L273 TraceCheckUtils]: 53: Hoare triple {2069#(= (_ bv8 32) main_~i~0)} assume true; {2069#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:51:09,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {2069#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2069#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:51:09,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {2069#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:09,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {2079#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2089#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:51:09,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {2089#(= (_ bv10 32) main_~i~0)} assume true; {2089#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:51:09,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {2089#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1901#false} is VALID [2018-11-14 15:51:09,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {1901#false} ~i~0 := 0bv32; {1901#false} is VALID [2018-11-14 15:51:09,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,372 INFO L273 TraceCheckUtils]: 63: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,372 INFO L273 TraceCheckUtils]: 65: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,373 INFO L273 TraceCheckUtils]: 67: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,373 INFO L273 TraceCheckUtils]: 68: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,374 INFO L273 TraceCheckUtils]: 69: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,374 INFO L273 TraceCheckUtils]: 70: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,375 INFO L273 TraceCheckUtils]: 72: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,375 INFO L273 TraceCheckUtils]: 73: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,375 INFO L273 TraceCheckUtils]: 74: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,375 INFO L273 TraceCheckUtils]: 75: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,376 INFO L273 TraceCheckUtils]: 76: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,376 INFO L273 TraceCheckUtils]: 77: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,376 INFO L273 TraceCheckUtils]: 78: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,376 INFO L273 TraceCheckUtils]: 79: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,377 INFO L273 TraceCheckUtils]: 80: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,377 INFO L273 TraceCheckUtils]: 81: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,377 INFO L273 TraceCheckUtils]: 82: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,377 INFO L273 TraceCheckUtils]: 83: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,378 INFO L273 TraceCheckUtils]: 84: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,378 INFO L273 TraceCheckUtils]: 85: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,378 INFO L273 TraceCheckUtils]: 86: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,378 INFO L273 TraceCheckUtils]: 87: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,379 INFO L273 TraceCheckUtils]: 88: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,379 INFO L273 TraceCheckUtils]: 89: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,379 INFO L273 TraceCheckUtils]: 90: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:09,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:09,380 INFO L273 TraceCheckUtils]: 92: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,380 INFO L273 TraceCheckUtils]: 93: Hoare triple {1901#false} assume !~bvslt32(~i~0, 100000bv32); {1901#false} is VALID [2018-11-14 15:51:09,380 INFO L273 TraceCheckUtils]: 94: Hoare triple {1901#false} havoc ~x~0;~x~0 := 0bv32; {1901#false} is VALID [2018-11-14 15:51:09,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:09,381 INFO L273 TraceCheckUtils]: 96: Hoare triple {1901#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1901#false} is VALID [2018-11-14 15:51:09,381 INFO L256 TraceCheckUtils]: 97: Hoare triple {1901#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1901#false} is VALID [2018-11-14 15:51:09,381 INFO L273 TraceCheckUtils]: 98: Hoare triple {1901#false} ~cond := #in~cond; {1901#false} is VALID [2018-11-14 15:51:09,382 INFO L273 TraceCheckUtils]: 99: Hoare triple {1901#false} assume ~cond == 0bv32; {1901#false} is VALID [2018-11-14 15:51:09,382 INFO L273 TraceCheckUtils]: 100: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2018-11-14 15:51:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-14 15:51:09,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:51:10,183 INFO L273 TraceCheckUtils]: 100: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2018-11-14 15:51:10,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {1901#false} assume ~cond == 0bv32; {1901#false} is VALID [2018-11-14 15:51:10,184 INFO L273 TraceCheckUtils]: 98: Hoare triple {1901#false} ~cond := #in~cond; {1901#false} is VALID [2018-11-14 15:51:10,184 INFO L256 TraceCheckUtils]: 97: Hoare triple {1901#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1901#false} is VALID [2018-11-14 15:51:10,184 INFO L273 TraceCheckUtils]: 96: Hoare triple {1901#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1901#false} is VALID [2018-11-14 15:51:10,184 INFO L273 TraceCheckUtils]: 95: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,185 INFO L273 TraceCheckUtils]: 94: Hoare triple {1901#false} havoc ~x~0;~x~0 := 0bv32; {1901#false} is VALID [2018-11-14 15:51:10,185 INFO L273 TraceCheckUtils]: 93: Hoare triple {1901#false} assume !~bvslt32(~i~0, 100000bv32); {1901#false} is VALID [2018-11-14 15:51:10,185 INFO L273 TraceCheckUtils]: 92: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,185 INFO L273 TraceCheckUtils]: 91: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 90: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 89: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 88: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 87: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,186 INFO L273 TraceCheckUtils]: 85: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 83: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 82: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 80: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,187 INFO L273 TraceCheckUtils]: 78: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 74: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 73: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 72: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,189 INFO L273 TraceCheckUtils]: 65: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {1901#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1901#false} is VALID [2018-11-14 15:51:10,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {1901#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1901#false} is VALID [2018-11-14 15:51:10,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {1901#false} assume true; {1901#false} is VALID [2018-11-14 15:51:10,190 INFO L273 TraceCheckUtils]: 61: Hoare triple {1901#false} ~i~0 := 0bv32; {1901#false} is VALID [2018-11-14 15:51:10,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {2336#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1901#false} is VALID [2018-11-14 15:51:10,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {2336#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2336#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:10,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2336#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:10,192 INFO L273 TraceCheckUtils]: 57: Hoare triple {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,198 INFO L273 TraceCheckUtils]: 55: Hoare triple {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,198 INFO L273 TraceCheckUtils]: 54: Hoare triple {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,205 INFO L273 TraceCheckUtils]: 52: Hoare triple {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2353#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2363#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,218 INFO L273 TraceCheckUtils]: 47: Hoare triple {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2373#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2383#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2393#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2403#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2413#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2423#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#true} ~i~0 := 0bv32; {2433#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:10,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#true} assume !~bvslt32(~i~0, 100000bv32); {1900#true} is VALID [2018-11-14 15:51:10,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,259 INFO L273 TraceCheckUtils]: 24: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,259 INFO L273 TraceCheckUtils]: 23: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,259 INFO L273 TraceCheckUtils]: 22: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {1900#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1900#true} is VALID [2018-11-14 15:51:10,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret6 := main(); {1900#true} is VALID [2018-11-14 15:51:10,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #80#return; {1900#true} is VALID [2018-11-14 15:51:10,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2018-11-14 15:51:10,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {1900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1900#true} is VALID [2018-11-14 15:51:10,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1900#true} is VALID [2018-11-14 15:51:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-14 15:51:10,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:51:10,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:51:10,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 15:51:10,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:51:10,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:51:10,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:10,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:51:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:51:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:51:10,461 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 24 states. [2018-11-14 15:51:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:18,953 INFO L93 Difference]: Finished difference Result 280 states and 321 transitions. [2018-11-14 15:51:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:51:18,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 15:51:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:51:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:51:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 263 transitions. [2018-11-14 15:51:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:51:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 263 transitions. [2018-11-14 15:51:18,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 263 transitions. [2018-11-14 15:51:19,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:19,483 INFO L225 Difference]: With dead ends: 280 [2018-11-14 15:51:19,483 INFO L226 Difference]: Without dead ends: 202 [2018-11-14 15:51:19,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 15:51:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-14 15:51:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-14 15:51:19,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:51:19,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 202 states. [2018-11-14 15:51:19,600 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2018-11-14 15:51:19,600 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2018-11-14 15:51:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:19,608 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-11-14 15:51:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2018-11-14 15:51:19,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:19,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:19,609 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2018-11-14 15:51:19,609 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2018-11-14 15:51:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:19,617 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-11-14 15:51:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2018-11-14 15:51:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:51:19,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:51:19,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:51:19,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:51:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-14 15:51:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 205 transitions. [2018-11-14 15:51:19,625 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 205 transitions. Word has length 101 [2018-11-14 15:51:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:51:19,626 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 205 transitions. [2018-11-14 15:51:19,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:51:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2018-11-14 15:51:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-14 15:51:19,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:51:19,629 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:51:19,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:51:19,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:51:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1568914883, now seen corresponding path program 4 times [2018-11-14 15:51:19,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:51:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:51:19,660 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:51:19,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:51:19,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:51:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:51:19,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:51:20,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {3622#true} call ULTIMATE.init(); {3622#true} is VALID [2018-11-14 15:51:20,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {3622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3622#true} is VALID [2018-11-14 15:51:20,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {3622#true} assume true; {3622#true} is VALID [2018-11-14 15:51:20,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3622#true} {3622#true} #80#return; {3622#true} is VALID [2018-11-14 15:51:20,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {3622#true} call #t~ret6 := main(); {3622#true} is VALID [2018-11-14 15:51:20,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {3622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3642#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:20,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {3642#(= main_~i~0 (_ bv0 32))} assume true; {3642#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:51:20,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {3642#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3649#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {3649#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3649#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {3649#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3656#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:20,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {3656#(= (_ bv2 32) main_~i~0)} assume true; {3656#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:51:20,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {3656#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3663#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {3663#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3663#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {3663#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3670#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {3670#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3670#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {3670#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3677#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {3677#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3677#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {3677#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3684#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {3684#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {3684#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {3684#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3691#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 15:51:20,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {3691#(= (_ bv7 32) main_~i~0)} assume true; {3691#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 15:51:20,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {3691#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3698#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {3698#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3698#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {3698#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3705#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 15:51:20,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {3705#(= (_ bv9 32) main_~i~0)} assume true; {3705#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 15:51:20,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {3705#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3712#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {3712#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3712#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {3712#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3719#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-14 15:51:20,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {3719#(= (_ bv11 32) main_~i~0)} assume true; {3719#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-14 15:51:20,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {3719#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3726#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {3726#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {3726#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {3726#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3733#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 15:51:20,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {3733#(= (_ bv13 32) main_~i~0)} assume true; {3733#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 15:51:20,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {3733#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3740#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {3740#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {3740#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,784 INFO L273 TraceCheckUtils]: 35: Hoare triple {3740#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3747#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {3747#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {3747#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {3747#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3754#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {3754#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {3754#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {3754#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3761#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:51:20,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {3761#(= (_ bv17 32) main_~i~0)} assume true; {3761#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:51:20,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {3761#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3768#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {3768#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {3768#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {3768#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3775#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {3775#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {3775#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {3775#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {3782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {3782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3789#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {3789#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {3789#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {3789#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3796#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {3796#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3796#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:51:20,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {3796#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:20,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {3623#false} ~i~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:20,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,798 INFO L273 TraceCheckUtils]: 55: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,798 INFO L273 TraceCheckUtils]: 56: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,799 INFO L273 TraceCheckUtils]: 57: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 60: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 62: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 63: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 66: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 72: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 73: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 74: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 75: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 76: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,802 INFO L273 TraceCheckUtils]: 77: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,803 INFO L273 TraceCheckUtils]: 78: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,803 INFO L273 TraceCheckUtils]: 79: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,803 INFO L273 TraceCheckUtils]: 80: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,803 INFO L273 TraceCheckUtils]: 81: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,803 INFO L273 TraceCheckUtils]: 82: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,804 INFO L273 TraceCheckUtils]: 83: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,804 INFO L273 TraceCheckUtils]: 84: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,804 INFO L273 TraceCheckUtils]: 85: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,804 INFO L273 TraceCheckUtils]: 86: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,804 INFO L273 TraceCheckUtils]: 87: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 89: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 90: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 91: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 92: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,805 INFO L273 TraceCheckUtils]: 93: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 94: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 95: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 97: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 98: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,806 INFO L273 TraceCheckUtils]: 99: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 100: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 101: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 102: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 103: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 104: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 105: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,807 INFO L273 TraceCheckUtils]: 106: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,808 INFO L273 TraceCheckUtils]: 107: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,808 INFO L273 TraceCheckUtils]: 108: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,808 INFO L273 TraceCheckUtils]: 109: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,808 INFO L273 TraceCheckUtils]: 110: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,809 INFO L273 TraceCheckUtils]: 111: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,809 INFO L273 TraceCheckUtils]: 112: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,809 INFO L273 TraceCheckUtils]: 113: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,809 INFO L273 TraceCheckUtils]: 114: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,809 INFO L273 TraceCheckUtils]: 115: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,810 INFO L273 TraceCheckUtils]: 116: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,810 INFO L273 TraceCheckUtils]: 117: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:20,810 INFO L273 TraceCheckUtils]: 118: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:20,810 INFO L273 TraceCheckUtils]: 119: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,810 INFO L273 TraceCheckUtils]: 120: Hoare triple {3623#false} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:20,811 INFO L273 TraceCheckUtils]: 121: Hoare triple {3623#false} ~i~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:20,811 INFO L273 TraceCheckUtils]: 122: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,811 INFO L273 TraceCheckUtils]: 123: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,811 INFO L273 TraceCheckUtils]: 124: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,811 INFO L273 TraceCheckUtils]: 125: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,812 INFO L273 TraceCheckUtils]: 126: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,812 INFO L273 TraceCheckUtils]: 127: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,812 INFO L273 TraceCheckUtils]: 128: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,812 INFO L273 TraceCheckUtils]: 129: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,813 INFO L273 TraceCheckUtils]: 130: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,813 INFO L273 TraceCheckUtils]: 131: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,813 INFO L273 TraceCheckUtils]: 132: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,813 INFO L273 TraceCheckUtils]: 133: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,813 INFO L273 TraceCheckUtils]: 134: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,814 INFO L273 TraceCheckUtils]: 135: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,814 INFO L273 TraceCheckUtils]: 136: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,814 INFO L273 TraceCheckUtils]: 137: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,814 INFO L273 TraceCheckUtils]: 138: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,815 INFO L273 TraceCheckUtils]: 139: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,815 INFO L273 TraceCheckUtils]: 140: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,815 INFO L273 TraceCheckUtils]: 141: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,815 INFO L273 TraceCheckUtils]: 142: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,815 INFO L273 TraceCheckUtils]: 143: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,816 INFO L273 TraceCheckUtils]: 144: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,816 INFO L273 TraceCheckUtils]: 145: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,816 INFO L273 TraceCheckUtils]: 146: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,816 INFO L273 TraceCheckUtils]: 147: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,816 INFO L273 TraceCheckUtils]: 148: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,817 INFO L273 TraceCheckUtils]: 149: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,817 INFO L273 TraceCheckUtils]: 150: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,817 INFO L273 TraceCheckUtils]: 151: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,817 INFO L273 TraceCheckUtils]: 152: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,818 INFO L273 TraceCheckUtils]: 153: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,818 INFO L273 TraceCheckUtils]: 154: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,818 INFO L273 TraceCheckUtils]: 155: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,818 INFO L273 TraceCheckUtils]: 156: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,818 INFO L273 TraceCheckUtils]: 157: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,819 INFO L273 TraceCheckUtils]: 158: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,819 INFO L273 TraceCheckUtils]: 159: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,819 INFO L273 TraceCheckUtils]: 160: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,819 INFO L273 TraceCheckUtils]: 161: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,820 INFO L273 TraceCheckUtils]: 162: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,820 INFO L273 TraceCheckUtils]: 163: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,820 INFO L273 TraceCheckUtils]: 164: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,820 INFO L273 TraceCheckUtils]: 165: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,820 INFO L273 TraceCheckUtils]: 166: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,821 INFO L273 TraceCheckUtils]: 167: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,821 INFO L273 TraceCheckUtils]: 168: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,821 INFO L273 TraceCheckUtils]: 169: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,821 INFO L273 TraceCheckUtils]: 170: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,821 INFO L273 TraceCheckUtils]: 171: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,822 INFO L273 TraceCheckUtils]: 172: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,822 INFO L273 TraceCheckUtils]: 173: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,822 INFO L273 TraceCheckUtils]: 174: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,822 INFO L273 TraceCheckUtils]: 175: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,822 INFO L273 TraceCheckUtils]: 176: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,823 INFO L273 TraceCheckUtils]: 177: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,823 INFO L273 TraceCheckUtils]: 178: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,823 INFO L273 TraceCheckUtils]: 179: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,823 INFO L273 TraceCheckUtils]: 180: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,824 INFO L273 TraceCheckUtils]: 181: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,824 INFO L273 TraceCheckUtils]: 182: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,824 INFO L273 TraceCheckUtils]: 183: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,824 INFO L273 TraceCheckUtils]: 184: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,825 INFO L273 TraceCheckUtils]: 185: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,825 INFO L273 TraceCheckUtils]: 186: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:20,825 INFO L273 TraceCheckUtils]: 187: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:20,825 INFO L273 TraceCheckUtils]: 188: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,825 INFO L273 TraceCheckUtils]: 189: Hoare triple {3623#false} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:20,826 INFO L273 TraceCheckUtils]: 190: Hoare triple {3623#false} havoc ~x~0;~x~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:20,826 INFO L273 TraceCheckUtils]: 191: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:20,826 INFO L273 TraceCheckUtils]: 192: Hoare triple {3623#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3623#false} is VALID [2018-11-14 15:51:20,826 INFO L256 TraceCheckUtils]: 193: Hoare triple {3623#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {3623#false} is VALID [2018-11-14 15:51:20,827 INFO L273 TraceCheckUtils]: 194: Hoare triple {3623#false} ~cond := #in~cond; {3623#false} is VALID [2018-11-14 15:51:20,827 INFO L273 TraceCheckUtils]: 195: Hoare triple {3623#false} assume ~cond == 0bv32; {3623#false} is VALID [2018-11-14 15:51:20,827 INFO L273 TraceCheckUtils]: 196: Hoare triple {3623#false} assume !false; {3623#false} is VALID [2018-11-14 15:51:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-14 15:51:20,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:51:23,009 INFO L273 TraceCheckUtils]: 196: Hoare triple {3623#false} assume !false; {3623#false} is VALID [2018-11-14 15:51:23,009 INFO L273 TraceCheckUtils]: 195: Hoare triple {3623#false} assume ~cond == 0bv32; {3623#false} is VALID [2018-11-14 15:51:23,009 INFO L273 TraceCheckUtils]: 194: Hoare triple {3623#false} ~cond := #in~cond; {3623#false} is VALID [2018-11-14 15:51:23,009 INFO L256 TraceCheckUtils]: 193: Hoare triple {3623#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {3623#false} is VALID [2018-11-14 15:51:23,009 INFO L273 TraceCheckUtils]: 192: Hoare triple {3623#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 191: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 190: Hoare triple {3623#false} havoc ~x~0;~x~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 189: Hoare triple {3623#false} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 188: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 187: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,010 INFO L273 TraceCheckUtils]: 186: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,011 INFO L273 TraceCheckUtils]: 185: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,011 INFO L273 TraceCheckUtils]: 184: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,011 INFO L273 TraceCheckUtils]: 183: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,011 INFO L273 TraceCheckUtils]: 182: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,011 INFO L273 TraceCheckUtils]: 181: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 180: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 179: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 178: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 177: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 176: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 175: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,012 INFO L273 TraceCheckUtils]: 174: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 173: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 172: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 171: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 170: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 169: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 168: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 167: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,013 INFO L273 TraceCheckUtils]: 166: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 165: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 164: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 163: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 162: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 161: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 160: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 159: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,014 INFO L273 TraceCheckUtils]: 158: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 157: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 156: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 155: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 154: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 153: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 152: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,015 INFO L273 TraceCheckUtils]: 151: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 150: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 149: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 148: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 147: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 146: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,016 INFO L273 TraceCheckUtils]: 145: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,017 INFO L273 TraceCheckUtils]: 144: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,017 INFO L273 TraceCheckUtils]: 143: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,017 INFO L273 TraceCheckUtils]: 142: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,017 INFO L273 TraceCheckUtils]: 141: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,017 INFO L273 TraceCheckUtils]: 140: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 139: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 138: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 137: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 136: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 135: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,018 INFO L273 TraceCheckUtils]: 134: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 133: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 132: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 131: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 130: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 129: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,019 INFO L273 TraceCheckUtils]: 128: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 127: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 126: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 125: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 124: Hoare triple {3623#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 123: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3623#false} is VALID [2018-11-14 15:51:23,020 INFO L273 TraceCheckUtils]: 122: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 121: Hoare triple {3623#false} ~i~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 120: Hoare triple {3623#false} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 119: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 118: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 117: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,021 INFO L273 TraceCheckUtils]: 116: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,022 INFO L273 TraceCheckUtils]: 115: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,022 INFO L273 TraceCheckUtils]: 114: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,022 INFO L273 TraceCheckUtils]: 113: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,022 INFO L273 TraceCheckUtils]: 112: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,022 INFO L273 TraceCheckUtils]: 111: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,023 INFO L273 TraceCheckUtils]: 110: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,023 INFO L273 TraceCheckUtils]: 109: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,023 INFO L273 TraceCheckUtils]: 108: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,023 INFO L273 TraceCheckUtils]: 106: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 105: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 104: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 103: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 102: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 101: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,024 INFO L273 TraceCheckUtils]: 100: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 99: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 98: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 97: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 96: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 95: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,025 INFO L273 TraceCheckUtils]: 94: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,026 INFO L273 TraceCheckUtils]: 93: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,026 INFO L273 TraceCheckUtils]: 92: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,026 INFO L273 TraceCheckUtils]: 91: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,026 INFO L273 TraceCheckUtils]: 89: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 86: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 85: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 84: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,027 INFO L273 TraceCheckUtils]: 83: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 82: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 81: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 80: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,028 INFO L273 TraceCheckUtils]: 77: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 76: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,029 INFO L273 TraceCheckUtils]: 71: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,030 INFO L273 TraceCheckUtils]: 70: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,030 INFO L273 TraceCheckUtils]: 69: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,030 INFO L273 TraceCheckUtils]: 68: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,030 INFO L273 TraceCheckUtils]: 67: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,030 INFO L273 TraceCheckUtils]: 66: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 65: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 64: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 63: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 62: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 61: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,031 INFO L273 TraceCheckUtils]: 60: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 59: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 58: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 57: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 56: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {3623#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#false} is VALID [2018-11-14 15:51:23,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {3623#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {3623#false} is VALID [2018-11-14 15:51:23,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {3623#false} assume true; {3623#false} is VALID [2018-11-14 15:51:23,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {3623#false} ~i~0 := 0bv32; {3623#false} is VALID [2018-11-14 15:51:23,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {4673#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3623#false} is VALID [2018-11-14 15:51:23,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {4673#(bvslt main_~i~0 (_ bv100000 32))} assume true; {4673#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:23,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {4680#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4673#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:51:23,050 INFO L273 TraceCheckUtils]: 48: Hoare triple {4680#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {4680#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,055 INFO L273 TraceCheckUtils]: 47: Hoare triple {4687#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4680#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {4687#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {4687#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {4694#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4687#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,060 INFO L273 TraceCheckUtils]: 44: Hoare triple {4694#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {4694#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {4701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4694#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {4701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {4701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {4708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {4708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {4708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {4715#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,075 INFO L273 TraceCheckUtils]: 38: Hoare triple {4715#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {4715#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {4722#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4715#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {4722#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {4722#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {4729#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4722#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,087 INFO L273 TraceCheckUtils]: 34: Hoare triple {4729#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {4729#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {4736#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4729#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {4736#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {4736#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {4743#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4736#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {4743#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {4743#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {4750#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4743#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {4750#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {4750#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {4757#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4750#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {4757#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {4757#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {4764#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4757#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {4764#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {4764#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {4771#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4764#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {4771#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {4771#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,120 INFO L273 TraceCheckUtils]: 21: Hoare triple {4778#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4771#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {4778#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {4778#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {4785#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4778#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {4785#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {4785#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {4792#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4785#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {4792#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {4792#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {4799#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4792#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {4799#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {4799#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {4806#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4799#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {4806#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {4806#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {4813#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4806#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {4813#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {4813#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {4820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4813#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {4820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {4820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {4827#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {4827#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {4827#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {3622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {4827#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:51:23,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {3622#true} call #t~ret6 := main(); {3622#true} is VALID [2018-11-14 15:51:23,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3622#true} {3622#true} #80#return; {3622#true} is VALID [2018-11-14 15:51:23,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {3622#true} assume true; {3622#true} is VALID [2018-11-14 15:51:23,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {3622#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3622#true} is VALID [2018-11-14 15:51:23,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {3622#true} call ULTIMATE.init(); {3622#true} is VALID [2018-11-14 15:51:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-14 15:51:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:51:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:51:23,275 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 197 [2018-11-14 15:51:23,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:51:23,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:51:23,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:51:23,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:51:23,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:51:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:51:23,512 INFO L87 Difference]: Start difference. First operand 202 states and 205 transitions. Second operand 48 states. [2018-11-14 15:51:27,305 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:51:27,777 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:51:28,304 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:51:28,843 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:51:29,391 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:51:29,928 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:51:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:51:59,457 INFO L93 Difference]: Finished difference Result 544 states and 621 transitions. [2018-11-14 15:51:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:51:59,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 197 [2018-11-14 15:51:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:51:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:51:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 491 transitions. [2018-11-14 15:51:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:51:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 491 transitions. [2018-11-14 15:51:59,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 491 transitions. [2018-11-14 15:52:00,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:00,954 INFO L225 Difference]: With dead ends: 544 [2018-11-14 15:52:00,954 INFO L226 Difference]: Without dead ends: 394 [2018-11-14 15:52:00,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:52:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-14 15:52:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-11-14 15:52:01,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:01,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand 394 states. [2018-11-14 15:52:01,882 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand 394 states. [2018-11-14 15:52:01,883 INFO L87 Difference]: Start difference. First operand 394 states. Second operand 394 states. [2018-11-14 15:52:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:01,898 INFO L93 Difference]: Finished difference Result 394 states and 397 transitions. [2018-11-14 15:52:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-11-14 15:52:01,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:01,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:01,900 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand 394 states. [2018-11-14 15:52:01,900 INFO L87 Difference]: Start difference. First operand 394 states. Second operand 394 states. [2018-11-14 15:52:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:01,915 INFO L93 Difference]: Finished difference Result 394 states and 397 transitions. [2018-11-14 15:52:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-11-14 15:52:01,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:01,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:01,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:01,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-14 15:52:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 397 transitions. [2018-11-14 15:52:01,930 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 397 transitions. Word has length 197 [2018-11-14 15:52:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:01,931 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 397 transitions. [2018-11-14 15:52:01,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:52:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-11-14 15:52:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-14 15:52:01,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:01,937 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:01,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:01,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1432479699, now seen corresponding path program 5 times [2018-11-14 15:52:01,939 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:01,939 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:52:01,966 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1