java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy7_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,290 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,293 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,311 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,312 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,314 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,315 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,315 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,316 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,316 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,316 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,317 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,317 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,388 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_false-unreach-call_ground.i [2018-11-23 11:51:45,451 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8673d8555/f61397d10e294d489a1c9a16761843c1/FLAGd1e200f2c [2018-11-23 11:51:45,949 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,950 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_false-unreach-call_ground.i [2018-11-23 11:51:45,956 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8673d8555/f61397d10e294d489a1c9a16761843c1/FLAGd1e200f2c [2018-11-23 11:51:46,292 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8673d8555/f61397d10e294d489a1c9a16761843c1 [2018-11-23 11:51:46,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6d2795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,626 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,712 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,061 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,061 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 11:51:48,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48 BoogieIcfgContainer [2018-11-23 11:51:48,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:48,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf0668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:48,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf0668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48" (3/3) ... [2018-11-23 11:51:48,071 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy7_false-unreach-call_ground.i [2018-11-23 11:51:48,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,143 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,144 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,145 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-23 11:51:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:51:48,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,181 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2029657296, now seen corresponding path program 1 times [2018-11-23 11:51:48,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-23 11:51:48,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-23 11:51:48,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-23 11:51:48,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-23 11:51:48,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret20 := main(); {48#true} is VALID [2018-11-23 11:51:48,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {48#true} is VALID [2018-11-23 11:51:48,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-23 11:51:48,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} havoc ~i~0;~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:51:48,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:51:48,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:51:48,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:51:48,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:51:48,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 11:51:48,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 11:51:48,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {49#false} havoc ~x~0;~x~0 := 0; {49#false} is VALID [2018-11-23 11:51:48,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {49#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {49#false} is VALID [2018-11-23 11:51:48,385 INFO L256 TraceCheckUtils]: 23: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {49#false} is VALID [2018-11-23 11:51:48,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-23 11:51:48,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {49#false} assume 0 == ~cond; {49#false} is VALID [2018-11-23 11:51:48,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-23 11:51:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:51:48,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,514 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-23 11:51:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,814 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2018-11-23 11:51:48,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,814 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:51:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 11:51:49,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,457 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:51:49,457 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:51:49,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:51:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:51:49,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:51:49,621 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:51:49,622 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:51:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,627 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:51:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:51:49,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,628 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:51:49,629 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:51:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,634 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:51:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:51:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:51:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 11:51:49,643 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 11:51:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,644 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 11:51:49,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:51:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:51:49,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2073025378, now seen corresponding path program 1 times [2018-11-23 11:51:49,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-23 11:51:49,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {294#true} is VALID [2018-11-23 11:51:49,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-23 11:51:49,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #147#return; {294#true} is VALID [2018-11-23 11:51:49,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret20 := main(); {294#true} is VALID [2018-11-23 11:51:49,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {296#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {296#(= main_~a~0 0)} assume !(~a~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#false} havoc ~i~0;~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:51:49,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {295#false} havoc ~x~0;~x~0 := 0; {295#false} is VALID [2018-11-23 11:51:49,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {295#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {295#false} is VALID [2018-11-23 11:51:49,788 INFO L256 TraceCheckUtils]: 23: Hoare triple {295#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {295#false} is VALID [2018-11-23 11:51:49,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2018-11-23 11:51:49,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2018-11-23 11:51:49,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-23 11:51:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:51:49,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,869 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-23 11:51:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,111 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 11:51:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:51:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:51:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:51:50,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 11:51:50,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,309 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:51:50,310 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:51:50,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:51:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 11:51:50,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 11:51:50,349 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 11:51:50,349 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 11:51:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,352 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:51:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:51:50,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,353 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 11:51:50,353 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 11:51:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,357 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:51:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:51:50,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:51:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 11:51:50,361 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2018-11-23 11:51:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,362 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 11:51:50,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 11:51:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:50,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -55785284, now seen corresponding path program 1 times [2018-11-23 11:51:50,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 11:51:50,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {540#true} is VALID [2018-11-23 11:51:50,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 11:51:50,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #147#return; {540#true} is VALID [2018-11-23 11:51:50,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret20 := main(); {540#true} is VALID [2018-11-23 11:51:50,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {540#true} is VALID [2018-11-23 11:51:50,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {540#true} is VALID [2018-11-23 11:51:50,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {540#true} is VALID [2018-11-23 11:51:50,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#true} assume !(~a~0 < 100000); {540#true} is VALID [2018-11-23 11:51:50,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#true} havoc ~i~0;~i~0 := 0; {542#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(= main_~i~0 0)} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:51:50,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {541#false} havoc ~x~0;~x~0 := 0; {541#false} is VALID [2018-11-23 11:51:50,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {541#false} is VALID [2018-11-23 11:51:50,469 INFO L256 TraceCheckUtils]: 25: Hoare triple {541#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {541#false} is VALID [2018-11-23 11:51:50,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {541#false} ~cond := #in~cond; {541#false} is VALID [2018-11-23 11:51:50,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {541#false} assume 0 == ~cond; {541#false} is VALID [2018-11-23 11:51:50,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 11:51:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:50,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:51:50,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,557 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 3 states. [2018-11-23 11:51:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,852 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-23 11:51:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:51:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 11:51:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 11:51:50,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-23 11:51:51,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,033 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:51:51,033 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:51,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-11-23 11:51:51,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 48 states. [2018-11-23 11:51:51,099 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 48 states. [2018-11-23 11:51:51,099 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 48 states. [2018-11-23 11:51:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,102 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:51:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 11:51:51,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,104 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 55 states. [2018-11-23 11:51:51,104 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 55 states. [2018-11-23 11:51:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,107 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:51:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 11:51:51,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:51:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 11:51:51,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 29 [2018-11-23 11:51:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,112 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 11:51:51,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:51:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:51:51,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1132383374, now seen corresponding path program 1 times [2018-11-23 11:51:51,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 11:51:51,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 11:51:51,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 11:51:51,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #147#return; {842#true} is VALID [2018-11-23 11:51:51,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret20 := main(); {842#true} is VALID [2018-11-23 11:51:51,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {844#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {844#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~a~0 1)} assume !(~a~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#false} havoc ~i~0;~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {843#false} is VALID [2018-11-23 11:51:51,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {843#false} is VALID [2018-11-23 11:51:51,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {843#false} is VALID [2018-11-23 11:51:51,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {843#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {843#false} is VALID [2018-11-23 11:51:51,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {843#false} is VALID [2018-11-23 11:51:51,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {843#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {843#false} is VALID [2018-11-23 11:51:51,302 INFO L273 TraceCheckUtils]: 20: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {843#false} is VALID [2018-11-23 11:51:51,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {843#false} is VALID [2018-11-23 11:51:51,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {843#false} is VALID [2018-11-23 11:51:51,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {843#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {843#false} is VALID [2018-11-23 11:51:51,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {843#false} is VALID [2018-11-23 11:51:51,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {843#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {843#false} is VALID [2018-11-23 11:51:51,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {843#false} is VALID [2018-11-23 11:51:51,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {843#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {843#false} is VALID [2018-11-23 11:51:51,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {843#false} havoc ~x~0;~x~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {843#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {843#false} is VALID [2018-11-23 11:51:51,308 INFO L256 TraceCheckUtils]: 39: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {843#false} is VALID [2018-11-23 11:51:51,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {843#false} ~cond := #in~cond; {843#false} is VALID [2018-11-23 11:51:51,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {843#false} assume 0 == ~cond; {843#false} is VALID [2018-11-23 11:51:51,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 11:51:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:51:51,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 11:51:51,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 11:51:51,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 11:51:51,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #147#return; {842#true} is VALID [2018-11-23 11:51:51,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret20 := main(); {842#true} is VALID [2018-11-23 11:51:51,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {864#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {864#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {864#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {864#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~a~0 1)} assume !(~a~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#false} havoc ~i~0;~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {843#false} is VALID [2018-11-23 11:51:51,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {843#false} is VALID [2018-11-23 11:51:51,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {843#false} is VALID [2018-11-23 11:51:51,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {843#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {843#false} is VALID [2018-11-23 11:51:51,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {843#false} is VALID [2018-11-23 11:51:51,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {843#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {843#false} is VALID [2018-11-23 11:51:51,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {843#false} is VALID [2018-11-23 11:51:51,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {843#false} is VALID [2018-11-23 11:51:51,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {843#false} is VALID [2018-11-23 11:51:51,724 INFO L273 TraceCheckUtils]: 27: Hoare triple {843#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {843#false} is VALID [2018-11-23 11:51:51,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,725 INFO L273 TraceCheckUtils]: 29: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {843#false} is VALID [2018-11-23 11:51:51,726 INFO L273 TraceCheckUtils]: 31: Hoare triple {843#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {843#false} is VALID [2018-11-23 11:51:51,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {843#false} is VALID [2018-11-23 11:51:51,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {843#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {843#false} is VALID [2018-11-23 11:51:51,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:51:51,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {843#false} havoc ~x~0;~x~0 := 0; {843#false} is VALID [2018-11-23 11:51:51,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {843#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {843#false} is VALID [2018-11-23 11:51:51,728 INFO L256 TraceCheckUtils]: 39: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {843#false} is VALID [2018-11-23 11:51:51,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {843#false} ~cond := #in~cond; {843#false} is VALID [2018-11-23 11:51:51,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {843#false} assume 0 == ~cond; {843#false} is VALID [2018-11-23 11:51:51,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 11:51:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:51:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:51,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 11:51:51,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:51,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,911 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-11-23 11:51:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,194 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-11-23 11:51:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:52,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 11:51:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 11:51:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 11:51:52,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-23 11:51:52,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,426 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:51:52,428 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:51:52,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:51:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 11:51:52,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 11:51:52,505 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 11:51:52,505 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 11:51:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,507 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:51:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:51:52,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,509 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 11:51:52,509 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 11:51:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,512 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:51:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:51:52,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:51:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-23 11:51:52,516 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2018-11-23 11:51:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,517 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-23 11:51:52,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 11:51:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:51:52,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,518 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 165377196, now seen corresponding path program 2 times [2018-11-23 11:51:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-23 11:51:52,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1282#true} is VALID [2018-11-23 11:51:52,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-23 11:51:52,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1282#true} {1282#true} #147#return; {1282#true} is VALID [2018-11-23 11:51:52,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {1282#true} call #t~ret20 := main(); {1282#true} is VALID [2018-11-23 11:51:52,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1284#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1284#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1285#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1285#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {1285#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1286#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {1283#false} havoc ~i~0;~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1283#false} is VALID [2018-11-23 11:51:52,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {1283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1283#false} is VALID [2018-11-23 11:51:52,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1283#false} is VALID [2018-11-23 11:51:52,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {1283#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1283#false} is VALID [2018-11-23 11:51:52,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1283#false} is VALID [2018-11-23 11:51:52,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {1283#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1283#false} is VALID [2018-11-23 11:51:52,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1283#false} is VALID [2018-11-23 11:51:52,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {1283#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1283#false} is VALID [2018-11-23 11:51:52,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1283#false} is VALID [2018-11-23 11:51:52,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {1283#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1283#false} is VALID [2018-11-23 11:51:52,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1283#false} is VALID [2018-11-23 11:51:52,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {1283#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1283#false} is VALID [2018-11-23 11:51:52,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1283#false} is VALID [2018-11-23 11:51:52,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {1283#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1283#false} is VALID [2018-11-23 11:51:52,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {1283#false} havoc ~x~0;~x~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {1283#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1283#false} is VALID [2018-11-23 11:51:52,693 INFO L256 TraceCheckUtils]: 41: Hoare triple {1283#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {1283#false} is VALID [2018-11-23 11:51:52,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2018-11-23 11:51:52,694 INFO L273 TraceCheckUtils]: 43: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2018-11-23 11:51:52,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-23 11:51:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:51:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:52,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-23 11:51:52,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1282#true} is VALID [2018-11-23 11:51:52,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-23 11:51:52,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1282#true} {1282#true} #147#return; {1282#true} is VALID [2018-11-23 11:51:52,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1282#true} call #t~ret20 := main(); {1282#true} is VALID [2018-11-23 11:51:52,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {1282#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1282#true} is VALID [2018-11-23 11:51:52,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {1282#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1282#true} is VALID [2018-11-23 11:51:52,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {1282#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1282#true} is VALID [2018-11-23 11:51:52,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {1282#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1282#true} is VALID [2018-11-23 11:51:52,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {1282#true} assume !(~a~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#true} havoc ~i~0;~i~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {1282#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1282#true} is VALID [2018-11-23 11:51:52,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1282#true} is VALID [2018-11-23 11:51:52,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1282#true} is VALID [2018-11-23 11:51:52,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1282#true} is VALID [2018-11-23 11:51:52,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {1282#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1282#true} is VALID [2018-11-23 11:51:52,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1282#true} is VALID [2018-11-23 11:51:52,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1282#true} is VALID [2018-11-23 11:51:52,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1282#true} is VALID [2018-11-23 11:51:52,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:51:52,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1282#true} is VALID [2018-11-23 11:51:52,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1282#true} is VALID [2018-11-23 11:51:52,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:51:52,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#true} ~i~0 := 0; {1383#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {1383#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1383#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {1383#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1390#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {1283#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1283#false} is VALID [2018-11-23 11:51:52,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {1283#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1283#false} is VALID [2018-11-23 11:51:52,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:51:52,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {1283#false} havoc ~x~0;~x~0 := 0; {1283#false} is VALID [2018-11-23 11:51:52,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {1283#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1283#false} is VALID [2018-11-23 11:51:52,952 INFO L256 TraceCheckUtils]: 41: Hoare triple {1283#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {1283#false} is VALID [2018-11-23 11:51:52,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2018-11-23 11:51:52,952 INFO L273 TraceCheckUtils]: 43: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2018-11-23 11:51:52,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-23 11:51:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:51:52,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:52,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 11:51:52,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:53,138 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-23 11:51:53,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,139 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 7 states. [2018-11-23 11:51:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,753 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-11-23 11:51:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:53,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 11:51:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:51:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:51:53,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-23 11:51:53,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,965 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:51:53,966 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:51:53,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:51:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-11-23 11:51:54,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 66 states. [2018-11-23 11:51:54,044 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 66 states. [2018-11-23 11:51:54,044 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 66 states. [2018-11-23 11:51:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,048 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-23 11:51:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-11-23 11:51:54,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,049 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 74 states. [2018-11-23 11:51:54,049 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 74 states. [2018-11-23 11:51:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,052 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-23 11:51:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-11-23 11:51:54,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:51:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-11-23 11:51:54,056 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 45 [2018-11-23 11:51:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,057 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-23 11:51:54,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 11:51:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:51:54,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,059 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash -799866724, now seen corresponding path program 3 times [2018-11-23 11:51:54,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {1831#true} call ULTIMATE.init(); {1831#true} is VALID [2018-11-23 11:51:54,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {1831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1831#true} is VALID [2018-11-23 11:51:54,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {1831#true} assume true; {1831#true} is VALID [2018-11-23 11:51:54,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1831#true} {1831#true} #147#return; {1831#true} is VALID [2018-11-23 11:51:54,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {1831#true} call #t~ret20 := main(); {1831#true} is VALID [2018-11-23 11:51:54,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {1831#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1833#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {1833#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1833#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {1833#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1834#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {1834#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1834#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {1834#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {1835#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1835#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {1835#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {1836#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {1832#false} havoc ~i~0;~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1832#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {1832#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1832#false} is VALID [2018-11-23 11:51:54,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1832#false} is VALID [2018-11-23 11:51:54,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {1832#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1832#false} is VALID [2018-11-23 11:51:54,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1832#false} is VALID [2018-11-23 11:51:54,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {1832#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1832#false} is VALID [2018-11-23 11:51:54,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1832#false} is VALID [2018-11-23 11:51:54,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {1832#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1832#false} is VALID [2018-11-23 11:51:54,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1832#false} is VALID [2018-11-23 11:51:54,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {1832#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1832#false} is VALID [2018-11-23 11:51:54,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1832#false} is VALID [2018-11-23 11:51:54,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {1832#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1832#false} is VALID [2018-11-23 11:51:54,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1832#false} is VALID [2018-11-23 11:51:54,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {1832#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1832#false} is VALID [2018-11-23 11:51:54,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1832#false} is VALID [2018-11-23 11:51:54,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {1832#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1832#false} is VALID [2018-11-23 11:51:54,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1832#false} is VALID [2018-11-23 11:51:54,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {1832#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1832#false} is VALID [2018-11-23 11:51:54,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1832#false} is VALID [2018-11-23 11:51:54,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {1832#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1832#false} is VALID [2018-11-23 11:51:54,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1832#false} is VALID [2018-11-23 11:51:54,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {1832#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1832#false} is VALID [2018-11-23 11:51:54,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1832#false} is VALID [2018-11-23 11:51:54,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {1832#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1832#false} is VALID [2018-11-23 11:51:54,474 INFO L273 TraceCheckUtils]: 48: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1832#false} is VALID [2018-11-23 11:51:54,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {1832#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1832#false} is VALID [2018-11-23 11:51:54,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1832#false} is VALID [2018-11-23 11:51:54,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {1832#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1832#false} is VALID [2018-11-23 11:51:54,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:54,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {1832#false} havoc ~x~0;~x~0 := 0; {1832#false} is VALID [2018-11-23 11:51:54,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {1832#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1832#false} is VALID [2018-11-23 11:51:54,477 INFO L256 TraceCheckUtils]: 57: Hoare triple {1832#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {1832#false} is VALID [2018-11-23 11:51:54,477 INFO L273 TraceCheckUtils]: 58: Hoare triple {1832#false} ~cond := #in~cond; {1832#false} is VALID [2018-11-23 11:51:54,477 INFO L273 TraceCheckUtils]: 59: Hoare triple {1832#false} assume 0 == ~cond; {1832#false} is VALID [2018-11-23 11:51:54,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {1832#false} assume !false; {1832#false} is VALID [2018-11-23 11:51:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:51:54,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:54,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:54,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:54,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {1831#true} call ULTIMATE.init(); {1831#true} is VALID [2018-11-23 11:51:55,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {1831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1831#true} is VALID [2018-11-23 11:51:55,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {1831#true} assume true; {1831#true} is VALID [2018-11-23 11:51:55,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1831#true} {1831#true} #147#return; {1831#true} is VALID [2018-11-23 11:51:55,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {1831#true} call #t~ret20 := main(); {1831#true} is VALID [2018-11-23 11:51:55,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {1831#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1831#true} is VALID [2018-11-23 11:51:55,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {1831#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1831#true} is VALID [2018-11-23 11:51:55,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:51:55,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {1831#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1831#true} is VALID [2018-11-23 11:51:55,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:51:55,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {1831#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {1831#true} assume !(~a~0 < 100000); {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {1831#true} havoc ~i~0;~i~0 := 0; {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {1831#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1831#true} is VALID [2018-11-23 11:51:55,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1831#true} is VALID [2018-11-23 11:51:55,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {1831#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1831#true} is VALID [2018-11-23 11:51:55,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:51:55,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {1831#true} ~i~0 := 0; {1831#true} is VALID [2018-11-23 11:51:55,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1831#true} is VALID [2018-11-23 11:51:55,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {1831#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1831#true} is VALID [2018-11-23 11:51:55,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1831#true} is VALID [2018-11-23 11:51:55,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {1831#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1831#true} is VALID [2018-11-23 11:51:55,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:51:55,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {1831#true} ~i~0 := 0; {1831#true} is VALID [2018-11-23 11:51:55,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1831#true} is VALID [2018-11-23 11:51:55,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {1831#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1831#true} is VALID [2018-11-23 11:51:55,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {1831#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1831#true} is VALID [2018-11-23 11:51:55,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {1831#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1831#true} is VALID [2018-11-23 11:51:55,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:51:55,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {1831#true} ~i~0 := 0; {1933#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {1933#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1933#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,247 INFO L273 TraceCheckUtils]: 33: Hoare triple {1933#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,248 INFO L273 TraceCheckUtils]: 34: Hoare triple {1940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,249 INFO L273 TraceCheckUtils]: 35: Hoare triple {1940#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1947#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {1947#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:55,250 INFO L273 TraceCheckUtils]: 37: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:55,250 INFO L273 TraceCheckUtils]: 38: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1832#false} is VALID [2018-11-23 11:51:55,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {1832#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1832#false} is VALID [2018-11-23 11:51:55,251 INFO L273 TraceCheckUtils]: 40: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1832#false} is VALID [2018-11-23 11:51:55,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {1832#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1832#false} is VALID [2018-11-23 11:51:55,251 INFO L273 TraceCheckUtils]: 42: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:55,252 INFO L273 TraceCheckUtils]: 43: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:55,252 INFO L273 TraceCheckUtils]: 44: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1832#false} is VALID [2018-11-23 11:51:55,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {1832#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1832#false} is VALID [2018-11-23 11:51:55,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1832#false} is VALID [2018-11-23 11:51:55,253 INFO L273 TraceCheckUtils]: 47: Hoare triple {1832#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1832#false} is VALID [2018-11-23 11:51:55,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:55,253 INFO L273 TraceCheckUtils]: 49: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:51:55,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1832#false} is VALID [2018-11-23 11:51:55,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {1832#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1832#false} is VALID [2018-11-23 11:51:55,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {1832#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1832#false} is VALID [2018-11-23 11:51:55,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {1832#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1832#false} is VALID [2018-11-23 11:51:55,254 INFO L273 TraceCheckUtils]: 54: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:51:55,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {1832#false} havoc ~x~0;~x~0 := 0; {1832#false} is VALID [2018-11-23 11:51:55,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {1832#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1832#false} is VALID [2018-11-23 11:51:55,255 INFO L256 TraceCheckUtils]: 57: Hoare triple {1832#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {1832#false} is VALID [2018-11-23 11:51:55,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {1832#false} ~cond := #in~cond; {1832#false} is VALID [2018-11-23 11:51:55,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {1832#false} assume 0 == ~cond; {1832#false} is VALID [2018-11-23 11:51:55,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {1832#false} assume !false; {1832#false} is VALID [2018-11-23 11:51:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 11:51:55,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:55,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 11:51:55,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:55,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:55,355 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 9 states. [2018-11-23 11:51:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,325 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2018-11-23 11:51:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:56,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 11:51:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:51:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:51:56,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2018-11-23 11:51:56,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,489 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:51:56,489 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:51:56,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:51:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-23 11:51:56,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 82 states. [2018-11-23 11:51:56,578 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 82 states. [2018-11-23 11:51:56,578 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 82 states. [2018-11-23 11:51:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,581 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:51:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 11:51:56,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,582 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 90 states. [2018-11-23 11:51:56,582 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 90 states. [2018-11-23 11:51:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,585 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:51:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 11:51:56,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:51:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-11-23 11:51:56,589 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 61 [2018-11-23 11:51:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,589 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-11-23 11:51:56,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-11-23 11:51:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:51:56,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,591 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1047303028, now seen corresponding path program 4 times [2018-11-23 11:51:56,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {2531#true} call ULTIMATE.init(); {2531#true} is VALID [2018-11-23 11:51:56,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {2531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2531#true} is VALID [2018-11-23 11:51:56,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {2531#true} assume true; {2531#true} is VALID [2018-11-23 11:51:56,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2531#true} {2531#true} #147#return; {2531#true} is VALID [2018-11-23 11:51:56,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {2531#true} call #t~ret20 := main(); {2531#true} is VALID [2018-11-23 11:51:56,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {2531#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2533#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {2533#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2533#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {2533#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2534#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {2534#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2534#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {2534#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2535#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {2535#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2535#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {2535#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2536#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {2536#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2536#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {2536#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2537#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {2537#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {2532#false} havoc ~i~0;~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2532#false} is VALID [2018-11-23 11:51:56,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {2532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2532#false} is VALID [2018-11-23 11:51:56,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2532#false} is VALID [2018-11-23 11:51:56,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {2532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2532#false} is VALID [2018-11-23 11:51:56,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {2532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 25: Hoare triple {2532#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2532#false} is VALID [2018-11-23 11:51:56,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2532#false} is VALID [2018-11-23 11:51:56,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {2532#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2532#false} is VALID [2018-11-23 11:51:56,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2532#false} is VALID [2018-11-23 11:51:56,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {2532#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2532#false} is VALID [2018-11-23 11:51:56,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2532#false} is VALID [2018-11-23 11:51:56,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {2532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2532#false} is VALID [2018-11-23 11:51:56,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2532#false} is VALID [2018-11-23 11:51:56,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {2532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2532#false} is VALID [2018-11-23 11:51:56,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2532#false} is VALID [2018-11-23 11:51:56,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {2532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2532#false} is VALID [2018-11-23 11:51:56,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2532#false} is VALID [2018-11-23 11:51:56,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {2532#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2532#false} is VALID [2018-11-23 11:51:56,783 INFO L273 TraceCheckUtils]: 42: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2532#false} is VALID [2018-11-23 11:51:56,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {2532#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2532#false} is VALID [2018-11-23 11:51:56,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2532#false} is VALID [2018-11-23 11:51:56,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {2532#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2532#false} is VALID [2018-11-23 11:51:56,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2532#false} is VALID [2018-11-23 11:51:56,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {2532#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2532#false} is VALID [2018-11-23 11:51:56,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2532#false} is VALID [2018-11-23 11:51:56,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {2532#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2532#false} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 52: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2532#false} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {2532#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2532#false} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 54: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 55: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 56: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2532#false} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 57: Hoare triple {2532#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2532#false} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 58: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2532#false} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 59: Hoare triple {2532#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2532#false} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 60: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2532#false} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 61: Hoare triple {2532#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 62: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 63: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 64: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 65: Hoare triple {2532#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 66: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 67: Hoare triple {2532#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2532#false} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 68: Hoare triple {2532#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 69: Hoare triple {2532#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 70: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 71: Hoare triple {2532#false} havoc ~x~0;~x~0 := 0; {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 72: Hoare triple {2532#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L256 TraceCheckUtils]: 73: Hoare triple {2532#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 74: Hoare triple {2532#false} ~cond := #in~cond; {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 75: Hoare triple {2532#false} assume 0 == ~cond; {2532#false} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {2532#false} assume !false; {2532#false} is VALID [2018-11-23 11:51:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 11:51:56,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:56,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:56,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:56,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {2531#true} call ULTIMATE.init(); {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {2531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {2531#true} assume true; {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2531#true} {2531#true} #147#return; {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {2531#true} call #t~ret20 := main(); {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {2531#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {2531#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2531#true} is VALID [2018-11-23 11:51:57,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {2531#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {2531#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {2531#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:51:57,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {2531#true} assume !(~a~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {2531#true} havoc ~i~0;~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {2531#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {2531#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {2531#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2531#true} is VALID [2018-11-23 11:51:57,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {2531#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {2531#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2531#true} is VALID [2018-11-23 11:51:57,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {2531#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {2531#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {2531#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2531#true} is VALID [2018-11-23 11:51:57,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 37: Hoare triple {2531#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 38: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 39: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {2531#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {2531#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2531#true} is VALID [2018-11-23 11:51:57,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {2531#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 47: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 48: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {2531#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2531#true} is VALID [2018-11-23 11:51:57,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {2531#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2531#true} is VALID [2018-11-23 11:51:57,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2531#true} is VALID [2018-11-23 11:51:57,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {2531#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2531#true} is VALID [2018-11-23 11:51:57,271 INFO L273 TraceCheckUtils]: 54: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:51:57,271 INFO L273 TraceCheckUtils]: 56: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2531#true} is VALID [2018-11-23 11:51:57,272 INFO L273 TraceCheckUtils]: 57: Hoare triple {2531#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2531#true} is VALID [2018-11-23 11:51:57,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2531#true} is VALID [2018-11-23 11:51:57,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {2531#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2531#true} is VALID [2018-11-23 11:51:57,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {2531#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2531#true} is VALID [2018-11-23 11:51:57,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {2531#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2531#true} is VALID [2018-11-23 11:51:57,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:51:57,278 INFO L273 TraceCheckUtils]: 63: Hoare triple {2531#true} ~i~0 := 0; {2730#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:57,279 INFO L273 TraceCheckUtils]: 64: Hoare triple {2730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2730#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:57,279 INFO L273 TraceCheckUtils]: 65: Hoare triple {2730#(<= main_~i~0 0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2737#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,280 INFO L273 TraceCheckUtils]: 66: Hoare triple {2737#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2737#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,280 INFO L273 TraceCheckUtils]: 67: Hoare triple {2737#(<= main_~i~0 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2744#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,280 INFO L273 TraceCheckUtils]: 68: Hoare triple {2744#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2744#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,281 INFO L273 TraceCheckUtils]: 69: Hoare triple {2744#(<= main_~i~0 2)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2751#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,281 INFO L273 TraceCheckUtils]: 70: Hoare triple {2751#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:51:57,281 INFO L273 TraceCheckUtils]: 71: Hoare triple {2532#false} havoc ~x~0;~x~0 := 0; {2532#false} is VALID [2018-11-23 11:51:57,282 INFO L273 TraceCheckUtils]: 72: Hoare triple {2532#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {2532#false} is VALID [2018-11-23 11:51:57,282 INFO L256 TraceCheckUtils]: 73: Hoare triple {2532#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {2532#false} is VALID [2018-11-23 11:51:57,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {2532#false} ~cond := #in~cond; {2532#false} is VALID [2018-11-23 11:51:57,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {2532#false} assume 0 == ~cond; {2532#false} is VALID [2018-11-23 11:51:57,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {2532#false} assume !false; {2532#false} is VALID [2018-11-23 11:51:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:51:57,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 11:51:57,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:51:57,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:57,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:57,434 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 11 states. [2018-11-23 11:51:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,614 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 11:51:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:58,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:51:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2018-11-23 11:51:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2018-11-23 11:51:58,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 161 transitions. [2018-11-23 11:51:58,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,791 INFO L225 Difference]: With dead ends: 173 [2018-11-23 11:51:58,791 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:51:58,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:51:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-11-23 11:51:58,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 98 states. [2018-11-23 11:51:58,870 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 98 states. [2018-11-23 11:51:58,870 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 98 states. [2018-11-23 11:51:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,872 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 11:51:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-23 11:51:58,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,873 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 106 states. [2018-11-23 11:51:58,873 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 106 states. [2018-11-23 11:51:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,876 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 11:51:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-23 11:51:58,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:51:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-11-23 11:51:58,879 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 77 [2018-11-23 11:51:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,880 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-11-23 11:51:58,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-11-23 11:51:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:51:58,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,881 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,882 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1394391164, now seen corresponding path program 5 times [2018-11-23 11:51:58,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2018-11-23 11:51:59,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3382#true} is VALID [2018-11-23 11:51:59,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2018-11-23 11:51:59,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #147#return; {3382#true} is VALID [2018-11-23 11:51:59,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret20 := main(); {3382#true} is VALID [2018-11-23 11:51:59,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {3382#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3384#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {3384#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3384#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {3384#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3385#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {3385#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3385#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {3385#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3386#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {3386#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3386#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {3386#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3387#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {3387#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3387#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {3387#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3388#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {3388#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3388#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {3388#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3389#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {3389#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {3383#false} havoc ~i~0;~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3383#false} is VALID [2018-11-23 11:51:59,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {3383#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3383#false} is VALID [2018-11-23 11:51:59,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3383#false} is VALID [2018-11-23 11:51:59,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {3383#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3383#false} is VALID [2018-11-23 11:51:59,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3383#false} is VALID [2018-11-23 11:51:59,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {3383#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3383#false} is VALID [2018-11-23 11:51:59,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3383#false} is VALID [2018-11-23 11:51:59,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {3383#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3383#false} is VALID [2018-11-23 11:51:59,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3383#false} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {3383#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3383#false} is VALID [2018-11-23 11:51:59,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {3383#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {3383#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {3383#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3383#false} is VALID [2018-11-23 11:51:59,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3383#false} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {3383#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3383#false} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3383#false} is VALID [2018-11-23 11:51:59,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {3383#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {3383#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 44: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 45: Hoare triple {3383#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 46: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,074 INFO L273 TraceCheckUtils]: 47: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {3383#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {3383#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 52: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3383#false} is VALID [2018-11-23 11:51:59,075 INFO L273 TraceCheckUtils]: 53: Hoare triple {3383#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3383#false} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3383#false} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {3383#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3383#false} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 57: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {3383#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {3383#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {3383#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 65: Hoare triple {3383#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3383#false} is VALID [2018-11-23 11:51:59,077 INFO L273 TraceCheckUtils]: 66: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 68: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 69: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 70: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 71: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 72: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 73: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:51:59,078 INFO L273 TraceCheckUtils]: 74: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 76: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 77: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 78: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 79: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 80: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:51:59,079 INFO L273 TraceCheckUtils]: 81: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 84: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 85: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 86: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 87: Hoare triple {3383#false} havoc ~x~0;~x~0 := 0; {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L273 TraceCheckUtils]: 88: Hoare triple {3383#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {3383#false} is VALID [2018-11-23 11:51:59,080 INFO L256 TraceCheckUtils]: 89: Hoare triple {3383#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {3383#false} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 90: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2018-11-23 11:51:59,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2018-11-23 11:51:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 11:51:59,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:59,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:28,093 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:52:28,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:28,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2018-11-23 11:52:28,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3382#true} is VALID [2018-11-23 11:52:28,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2018-11-23 11:52:28,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #147#return; {3382#true} is VALID [2018-11-23 11:52:28,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret20 := main(); {3382#true} is VALID [2018-11-23 11:52:28,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {3382#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3382#true} is VALID [2018-11-23 11:52:28,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {3382#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {3382#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {3382#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:52:28,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {3382#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3382#true} is VALID [2018-11-23 11:52:28,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:52:28,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {3382#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3382#true} is VALID [2018-11-23 11:52:28,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:52:28,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {3382#true} assume !(~a~0 < 100000); {3382#true} is VALID [2018-11-23 11:52:28,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {3382#true} havoc ~i~0;~i~0 := 0; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {3382#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {3382#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3382#true} is VALID [2018-11-23 11:52:28,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {3382#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3382#true} is VALID [2018-11-23 11:52:28,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3382#true} is VALID [2018-11-23 11:52:28,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {3382#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3382#true} is VALID [2018-11-23 11:52:28,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:52:28,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {3382#true} ~i~0 := 0; {3382#true} is VALID [2018-11-23 11:52:28,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {3382#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 30: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 31: Hoare triple {3382#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 33: Hoare triple {3382#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3382#true} is VALID [2018-11-23 11:52:28,299 INFO L273 TraceCheckUtils]: 34: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {3382#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {3382#true} ~i~0 := 0; {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 39: Hoare triple {3382#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3382#true} is VALID [2018-11-23 11:52:28,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3382#true} is VALID [2018-11-23 11:52:28,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {3382#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3382#true} is VALID [2018-11-23 11:52:28,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3382#true} is VALID [2018-11-23 11:52:28,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {3382#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3382#true} is VALID [2018-11-23 11:52:28,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3382#true} is VALID [2018-11-23 11:52:28,301 INFO L273 TraceCheckUtils]: 45: Hoare triple {3382#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {3382#true} ~i~0 := 0; {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {3382#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 50: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3382#true} is VALID [2018-11-23 11:52:28,302 INFO L273 TraceCheckUtils]: 51: Hoare triple {3382#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3382#true} is VALID [2018-11-23 11:52:28,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3382#true} is VALID [2018-11-23 11:52:28,303 INFO L273 TraceCheckUtils]: 53: Hoare triple {3382#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3382#true} is VALID [2018-11-23 11:52:28,303 INFO L273 TraceCheckUtils]: 54: Hoare triple {3382#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3382#true} is VALID [2018-11-23 11:52:28,303 INFO L273 TraceCheckUtils]: 55: Hoare triple {3382#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3382#true} is VALID [2018-11-23 11:52:28,303 INFO L273 TraceCheckUtils]: 56: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:52:28,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {3382#true} ~i~0 := 0; {3564#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:28,312 INFO L273 TraceCheckUtils]: 58: Hoare triple {3564#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3564#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:28,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {3564#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3571#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:28,316 INFO L273 TraceCheckUtils]: 60: Hoare triple {3571#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3571#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:28,316 INFO L273 TraceCheckUtils]: 61: Hoare triple {3571#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3578#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:28,318 INFO L273 TraceCheckUtils]: 62: Hoare triple {3578#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3578#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:28,318 INFO L273 TraceCheckUtils]: 63: Hoare triple {3578#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3585#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:28,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {3585#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3585#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:28,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {3585#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3592#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {3592#(<= main_~i~0 4)} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 68: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 69: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 70: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 71: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:52:28,321 INFO L273 TraceCheckUtils]: 72: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 73: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 74: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 75: Hoare triple {3383#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 76: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 77: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 78: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 79: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:52:28,322 INFO L273 TraceCheckUtils]: 80: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 81: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 82: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 83: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 84: Hoare triple {3383#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 85: Hoare triple {3383#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 87: Hoare triple {3383#false} havoc ~x~0;~x~0 := 0; {3383#false} is VALID [2018-11-23 11:52:28,323 INFO L273 TraceCheckUtils]: 88: Hoare triple {3383#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {3383#false} is VALID [2018-11-23 11:52:28,324 INFO L256 TraceCheckUtils]: 89: Hoare triple {3383#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {3383#false} is VALID [2018-11-23 11:52:28,324 INFO L273 TraceCheckUtils]: 90: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2018-11-23 11:52:28,324 INFO L273 TraceCheckUtils]: 91: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2018-11-23 11:52:28,324 INFO L273 TraceCheckUtils]: 92: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2018-11-23 11:52:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:52:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:28,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:52:28,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-23 11:52:28,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:28,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:28,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:28,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:28,432 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 13 states. [2018-11-23 11:52:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,367 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2018-11-23 11:52:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:29,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-23 11:52:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 11:52:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 11:52:29,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2018-11-23 11:52:29,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:29,602 INFO L225 Difference]: With dead ends: 203 [2018-11-23 11:52:29,602 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:52:29,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:52:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-23 11:52:29,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:29,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:29,729 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:29,730 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,733 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-11-23 11:52:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-23 11:52:29,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,734 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 122 states. [2018-11-23 11:52:29,734 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 122 states. [2018-11-23 11:52:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,737 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-11-23 11:52:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-23 11:52:29,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:29,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:52:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-23 11:52:29,742 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 93 [2018-11-23 11:52:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:29,742 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-23 11:52:29,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-23 11:52:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:52:29,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:29,744 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:29,744 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:29,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -26286996, now seen corresponding path program 6 times [2018-11-23 11:52:29,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:30,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {4384#true} call ULTIMATE.init(); {4384#true} is VALID [2018-11-23 11:52:30,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {4384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4384#true} is VALID [2018-11-23 11:52:30,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {4384#true} assume true; {4384#true} is VALID [2018-11-23 11:52:30,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4384#true} {4384#true} #147#return; {4384#true} is VALID [2018-11-23 11:52:30,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {4384#true} call #t~ret20 := main(); {4384#true} is VALID [2018-11-23 11:52:30,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {4384#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4386#(= main_~a~0 0)} is VALID [2018-11-23 11:52:30,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {4386#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4386#(= main_~a~0 0)} is VALID [2018-11-23 11:52:30,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {4386#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4387#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:30,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {4387#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4387#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:30,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {4387#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4388#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:30,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {4388#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4388#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:30,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {4388#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4389#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:30,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {4389#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4389#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:30,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {4389#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4390#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:30,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {4390#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4390#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:30,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {4390#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4391#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:30,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {4391#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4391#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:30,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {4391#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4392#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:30,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {4392#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#false} havoc ~i~0;~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4385#false} is VALID [2018-11-23 11:52:30,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {4385#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4385#false} is VALID [2018-11-23 11:52:30,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4385#false} is VALID [2018-11-23 11:52:30,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {4385#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4385#false} is VALID [2018-11-23 11:52:30,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4385#false} is VALID [2018-11-23 11:52:30,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {4385#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4385#false} is VALID [2018-11-23 11:52:30,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4385#false} is VALID [2018-11-23 11:52:30,534 INFO L273 TraceCheckUtils]: 27: Hoare triple {4385#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4385#false} is VALID [2018-11-23 11:52:30,535 INFO L273 TraceCheckUtils]: 28: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4385#false} is VALID [2018-11-23 11:52:30,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {4385#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4385#false} is VALID [2018-11-23 11:52:30,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4385#false} is VALID [2018-11-23 11:52:30,536 INFO L273 TraceCheckUtils]: 33: Hoare triple {4385#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4385#false} is VALID [2018-11-23 11:52:30,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4385#false} is VALID [2018-11-23 11:52:30,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {4385#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4385#false} is VALID [2018-11-23 11:52:30,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {4385#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {4385#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {4385#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4385#false} is VALID [2018-11-23 11:52:30,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {4385#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {4385#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {4385#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4385#false} is VALID [2018-11-23 11:52:30,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {4385#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {4385#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {4385#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4385#false} is VALID [2018-11-23 11:52:30,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {4385#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {4385#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {4385#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 64: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 65: Hoare triple {4385#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4385#false} is VALID [2018-11-23 11:52:30,540 INFO L273 TraceCheckUtils]: 66: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,541 INFO L273 TraceCheckUtils]: 68: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4385#false} is VALID [2018-11-23 11:52:30,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {4385#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4385#false} is VALID [2018-11-23 11:52:30,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4385#false} is VALID [2018-11-23 11:52:30,541 INFO L273 TraceCheckUtils]: 71: Hoare triple {4385#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {4385#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {4385#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 76: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4385#false} is VALID [2018-11-23 11:52:30,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {4385#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4385#false} is VALID [2018-11-23 11:52:30,543 INFO L273 TraceCheckUtils]: 78: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,543 INFO L273 TraceCheckUtils]: 79: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,543 INFO L273 TraceCheckUtils]: 80: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4385#false} is VALID [2018-11-23 11:52:30,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {4385#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4385#false} is VALID [2018-11-23 11:52:30,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 83: Hoare triple {4385#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 84: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 85: Hoare triple {4385#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 86: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 87: Hoare triple {4385#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4385#false} is VALID [2018-11-23 11:52:30,544 INFO L273 TraceCheckUtils]: 88: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4385#false} is VALID [2018-11-23 11:52:30,545 INFO L273 TraceCheckUtils]: 89: Hoare triple {4385#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4385#false} is VALID [2018-11-23 11:52:30,545 INFO L273 TraceCheckUtils]: 90: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,545 INFO L273 TraceCheckUtils]: 91: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,545 INFO L273 TraceCheckUtils]: 92: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4385#false} is VALID [2018-11-23 11:52:30,545 INFO L273 TraceCheckUtils]: 93: Hoare triple {4385#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 94: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 95: Hoare triple {4385#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 96: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 97: Hoare triple {4385#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 98: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4385#false} is VALID [2018-11-23 11:52:30,546 INFO L273 TraceCheckUtils]: 99: Hoare triple {4385#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L273 TraceCheckUtils]: 100: Hoare triple {4385#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L273 TraceCheckUtils]: 101: Hoare triple {4385#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L273 TraceCheckUtils]: 102: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L273 TraceCheckUtils]: 103: Hoare triple {4385#false} havoc ~x~0;~x~0 := 0; {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L273 TraceCheckUtils]: 104: Hoare triple {4385#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {4385#false} is VALID [2018-11-23 11:52:30,547 INFO L256 TraceCheckUtils]: 105: Hoare triple {4385#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {4385#false} is VALID [2018-11-23 11:52:30,548 INFO L273 TraceCheckUtils]: 106: Hoare triple {4385#false} ~cond := #in~cond; {4385#false} is VALID [2018-11-23 11:52:30,548 INFO L273 TraceCheckUtils]: 107: Hoare triple {4385#false} assume 0 == ~cond; {4385#false} is VALID [2018-11-23 11:52:30,548 INFO L273 TraceCheckUtils]: 108: Hoare triple {4385#false} assume !false; {4385#false} is VALID [2018-11-23 11:52:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-23 11:52:30,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:30,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:30,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:33,468 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:33,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:33,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:34,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {4384#true} call ULTIMATE.init(); {4384#true} is VALID [2018-11-23 11:52:34,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {4384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4384#true} is VALID [2018-11-23 11:52:34,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {4384#true} assume true; {4384#true} is VALID [2018-11-23 11:52:34,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4384#true} {4384#true} #147#return; {4384#true} is VALID [2018-11-23 11:52:34,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {4384#true} call #t~ret20 := main(); {4384#true} is VALID [2018-11-23 11:52:34,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {4384#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {4384#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4384#true} is VALID [2018-11-23 11:52:34,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {4384#true} assume !(~a~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {4384#true} havoc ~i~0;~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {4384#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {4384#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4384#true} is VALID [2018-11-23 11:52:34,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {4384#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {4384#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {4384#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4384#true} is VALID [2018-11-23 11:52:34,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {4384#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {4384#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4384#true} is VALID [2018-11-23 11:52:34,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4384#true} is VALID [2018-11-23 11:52:34,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {4384#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4384#true} is VALID [2018-11-23 11:52:34,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4384#true} is VALID [2018-11-23 11:52:34,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {4384#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4384#true} is VALID [2018-11-23 11:52:34,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4384#true} is VALID [2018-11-23 11:52:34,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {4384#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4384#true} is VALID [2018-11-23 11:52:34,022 INFO L273 TraceCheckUtils]: 42: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4384#true} is VALID [2018-11-23 11:52:34,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {4384#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4384#true} is VALID [2018-11-23 11:52:34,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4384#true} is VALID [2018-11-23 11:52:34,023 INFO L273 TraceCheckUtils]: 47: Hoare triple {4384#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4384#true} is VALID [2018-11-23 11:52:34,023 INFO L273 TraceCheckUtils]: 48: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4384#true} is VALID [2018-11-23 11:52:34,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {4384#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4384#true} is VALID [2018-11-23 11:52:34,023 INFO L273 TraceCheckUtils]: 50: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4384#true} is VALID [2018-11-23 11:52:34,024 INFO L273 TraceCheckUtils]: 51: Hoare triple {4384#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4384#true} is VALID [2018-11-23 11:52:34,024 INFO L273 TraceCheckUtils]: 52: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4384#true} is VALID [2018-11-23 11:52:34,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {4384#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4384#true} is VALID [2018-11-23 11:52:34,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,024 INFO L273 TraceCheckUtils]: 55: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,025 INFO L273 TraceCheckUtils]: 56: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4384#true} is VALID [2018-11-23 11:52:34,025 INFO L273 TraceCheckUtils]: 57: Hoare triple {4384#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4384#true} is VALID [2018-11-23 11:52:34,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4384#true} is VALID [2018-11-23 11:52:34,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {4384#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4384#true} is VALID [2018-11-23 11:52:34,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4384#true} is VALID [2018-11-23 11:52:34,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {4384#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4384#true} is VALID [2018-11-23 11:52:34,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4384#true} is VALID [2018-11-23 11:52:34,026 INFO L273 TraceCheckUtils]: 63: Hoare triple {4384#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4384#true} is VALID [2018-11-23 11:52:34,043 INFO L273 TraceCheckUtils]: 64: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4588#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:34,044 INFO L273 TraceCheckUtils]: 65: Hoare triple {4588#(< main_~i~0 100000)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4592#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:34,044 INFO L273 TraceCheckUtils]: 66: Hoare triple {4592#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,044 INFO L273 TraceCheckUtils]: 67: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 68: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 69: Hoare triple {4384#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 70: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 71: Hoare triple {4384#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 72: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4384#true} is VALID [2018-11-23 11:52:34,045 INFO L273 TraceCheckUtils]: 73: Hoare triple {4384#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 74: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 75: Hoare triple {4384#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 76: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 77: Hoare triple {4384#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,046 INFO L273 TraceCheckUtils]: 79: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 81: Hoare triple {4384#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 82: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 83: Hoare triple {4384#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 84: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 85: Hoare triple {4384#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4384#true} is VALID [2018-11-23 11:52:34,047 INFO L273 TraceCheckUtils]: 86: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4384#true} is VALID [2018-11-23 11:52:34,048 INFO L273 TraceCheckUtils]: 87: Hoare triple {4384#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4384#true} is VALID [2018-11-23 11:52:34,048 INFO L273 TraceCheckUtils]: 88: Hoare triple {4384#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4384#true} is VALID [2018-11-23 11:52:34,048 INFO L273 TraceCheckUtils]: 89: Hoare triple {4384#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4384#true} is VALID [2018-11-23 11:52:34,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:52:34,065 INFO L273 TraceCheckUtils]: 91: Hoare triple {4384#true} ~i~0 := 0; {4671#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:34,074 INFO L273 TraceCheckUtils]: 92: Hoare triple {4671#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4671#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:34,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {4671#(<= main_~i~0 0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4678#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:34,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {4678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4678#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:34,091 INFO L273 TraceCheckUtils]: 95: Hoare triple {4678#(<= main_~i~0 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4685#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:34,093 INFO L273 TraceCheckUtils]: 96: Hoare triple {4685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4685#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:34,093 INFO L273 TraceCheckUtils]: 97: Hoare triple {4685#(<= main_~i~0 2)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:34,095 INFO L273 TraceCheckUtils]: 98: Hoare triple {4692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:34,095 INFO L273 TraceCheckUtils]: 99: Hoare triple {4692#(<= main_~i~0 3)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4699#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:34,096 INFO L273 TraceCheckUtils]: 100: Hoare triple {4699#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4699#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:34,097 INFO L273 TraceCheckUtils]: 101: Hoare triple {4699#(<= main_~i~0 4)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4706#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:34,097 INFO L273 TraceCheckUtils]: 102: Hoare triple {4706#(<= main_~i~0 5)} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:52:34,098 INFO L273 TraceCheckUtils]: 103: Hoare triple {4385#false} havoc ~x~0;~x~0 := 0; {4385#false} is VALID [2018-11-23 11:52:34,098 INFO L273 TraceCheckUtils]: 104: Hoare triple {4385#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {4385#false} is VALID [2018-11-23 11:52:34,098 INFO L256 TraceCheckUtils]: 105: Hoare triple {4385#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {4385#false} is VALID [2018-11-23 11:52:34,098 INFO L273 TraceCheckUtils]: 106: Hoare triple {4385#false} ~cond := #in~cond; {4385#false} is VALID [2018-11-23 11:52:34,099 INFO L273 TraceCheckUtils]: 107: Hoare triple {4385#false} assume 0 == ~cond; {4385#false} is VALID [2018-11-23 11:52:34,099 INFO L273 TraceCheckUtils]: 108: Hoare triple {4385#false} assume !false; {4385#false} is VALID [2018-11-23 11:52:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-23 11:52:34,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:34,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 11:52:34,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 11:52:34,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:52:34,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:34,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:52:34,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:52:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:34,242 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 17 states. [2018-11-23 11:52:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,762 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2018-11-23 11:52:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:35,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 11:52:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 207 transitions. [2018-11-23 11:52:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 207 transitions. [2018-11-23 11:52:35,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 207 transitions. [2018-11-23 11:52:36,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,036 INFO L225 Difference]: With dead ends: 240 [2018-11-23 11:52:36,036 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:52:36,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:52:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-23 11:52:36,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:36,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 144 states. [2018-11-23 11:52:36,107 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 144 states. [2018-11-23 11:52:36,107 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 144 states. [2018-11-23 11:52:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:36,112 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 11:52:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 11:52:36,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:36,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:36,112 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 145 states. [2018-11-23 11:52:36,113 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 145 states. [2018-11-23 11:52:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:36,117 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 11:52:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 11:52:36,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:36,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:36,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:36,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:52:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 11:52:36,123 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 109 [2018-11-23 11:52:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:36,123 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 11:52:36,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 11:52:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:52:36,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:36,125 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:36,125 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:36,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1417223214, now seen corresponding path program 7 times [2018-11-23 11:52:36,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:36,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {5588#true} call ULTIMATE.init(); {5588#true} is VALID [2018-11-23 11:52:36,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {5588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5588#true} is VALID [2018-11-23 11:52:36,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {5588#true} assume true; {5588#true} is VALID [2018-11-23 11:52:36,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5588#true} {5588#true} #147#return; {5588#true} is VALID [2018-11-23 11:52:36,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {5588#true} call #t~ret20 := main(); {5588#true} is VALID [2018-11-23 11:52:36,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {5588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5590#(= main_~a~0 0)} is VALID [2018-11-23 11:52:36,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {5590#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5590#(= main_~a~0 0)} is VALID [2018-11-23 11:52:36,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {5590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:36,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {5591#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:36,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {5591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:36,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {5592#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:36,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {5592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:36,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {5593#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:36,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {5593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:36,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {5594#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:36,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {5594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:36,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:36,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:36,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:36,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5597#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:36,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {5597#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {5589#false} havoc ~i~0;~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,756 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:36,757 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:36,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 44: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 49: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 54: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 57: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,760 INFO L273 TraceCheckUtils]: 58: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 59: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 60: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 62: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 63: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 64: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 65: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 66: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 68: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 69: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 70: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 72: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,762 INFO L273 TraceCheckUtils]: 74: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 75: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 76: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 77: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 78: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 79: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 80: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 82: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 83: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 84: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 86: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 87: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 88: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 89: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 90: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,764 INFO L273 TraceCheckUtils]: 91: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 94: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 95: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 96: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 97: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 98: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 99: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:36,765 INFO L273 TraceCheckUtils]: 100: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 101: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 102: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 103: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 104: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 105: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 106: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 107: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,766 INFO L273 TraceCheckUtils]: 108: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 109: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 110: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 111: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 112: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 113: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 114: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 115: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 116: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,767 INFO L273 TraceCheckUtils]: 117: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 118: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 119: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 120: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 121: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 122: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 123: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 124: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,768 INFO L273 TraceCheckUtils]: 125: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 126: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 127: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 128: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 129: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 130: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 131: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 132: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 133: Hoare triple {5589#false} havoc ~x~0;~x~0 := 0; {5589#false} is VALID [2018-11-23 11:52:36,769 INFO L273 TraceCheckUtils]: 134: Hoare triple {5589#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {5589#false} is VALID [2018-11-23 11:52:36,770 INFO L256 TraceCheckUtils]: 135: Hoare triple {5589#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {5589#false} is VALID [2018-11-23 11:52:36,770 INFO L273 TraceCheckUtils]: 136: Hoare triple {5589#false} ~cond := #in~cond; {5589#false} is VALID [2018-11-23 11:52:36,770 INFO L273 TraceCheckUtils]: 137: Hoare triple {5589#false} assume 0 == ~cond; {5589#false} is VALID [2018-11-23 11:52:36,770 INFO L273 TraceCheckUtils]: 138: Hoare triple {5589#false} assume !false; {5589#false} is VALID [2018-11-23 11:52:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:52:36,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:36,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:37,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {5588#true} call ULTIMATE.init(); {5588#true} is VALID [2018-11-23 11:52:37,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {5588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5588#true} is VALID [2018-11-23 11:52:37,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {5588#true} assume true; {5588#true} is VALID [2018-11-23 11:52:37,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5588#true} {5588#true} #147#return; {5588#true} is VALID [2018-11-23 11:52:37,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {5588#true} call #t~ret20 := main(); {5588#true} is VALID [2018-11-23 11:52:37,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {5588#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5616#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:37,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {5616#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5616#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:37,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {5616#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:37,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {5591#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:37,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {5591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:37,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {5592#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:37,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {5592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:37,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {5593#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:37,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {5593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:37,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {5594#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:37,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {5594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:37,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:37,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:37,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:37,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5597#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:37,052 INFO L273 TraceCheckUtils]: 20: Hoare triple {5597#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {5589#false} havoc ~i~0;~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,054 INFO L273 TraceCheckUtils]: 30: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,054 INFO L273 TraceCheckUtils]: 31: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,054 INFO L273 TraceCheckUtils]: 32: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,055 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,055 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5589#false} is VALID [2018-11-23 11:52:37,055 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5589#false} is VALID [2018-11-23 11:52:37,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,056 INFO L273 TraceCheckUtils]: 38: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,056 INFO L273 TraceCheckUtils]: 42: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 44: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 46: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5589#false} is VALID [2018-11-23 11:52:37,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {5589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 55: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 57: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 58: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,058 INFO L273 TraceCheckUtils]: 59: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 60: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 61: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 62: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 63: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 64: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 65: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 66: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 67: Hoare triple {5589#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5589#false} is VALID [2018-11-23 11:52:37,059 INFO L273 TraceCheckUtils]: 68: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 69: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 70: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 71: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 72: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 75: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,060 INFO L273 TraceCheckUtils]: 76: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 77: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 78: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 79: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 80: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 81: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 82: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 83: Hoare triple {5589#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,061 INFO L273 TraceCheckUtils]: 85: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 86: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 88: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 89: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 90: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 91: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 92: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,062 INFO L273 TraceCheckUtils]: 93: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 95: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 96: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 97: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 98: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 99: Hoare triple {5589#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 100: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 101: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,063 INFO L273 TraceCheckUtils]: 102: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 103: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 104: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 105: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 106: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 107: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 108: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 109: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,064 INFO L273 TraceCheckUtils]: 110: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 111: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 112: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 113: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 114: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 115: Hoare triple {5589#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 116: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 117: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 118: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,065 INFO L273 TraceCheckUtils]: 119: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 120: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 121: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 122: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 123: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 124: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 125: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 126: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,066 INFO L273 TraceCheckUtils]: 127: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 128: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 129: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 130: Hoare triple {5589#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 131: Hoare triple {5589#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 132: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 133: Hoare triple {5589#false} havoc ~x~0;~x~0 := 0; {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 134: Hoare triple {5589#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L256 TraceCheckUtils]: 135: Hoare triple {5589#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {5589#false} is VALID [2018-11-23 11:52:37,067 INFO L273 TraceCheckUtils]: 136: Hoare triple {5589#false} ~cond := #in~cond; {5589#false} is VALID [2018-11-23 11:52:37,068 INFO L273 TraceCheckUtils]: 137: Hoare triple {5589#false} assume 0 == ~cond; {5589#false} is VALID [2018-11-23 11:52:37,068 INFO L273 TraceCheckUtils]: 138: Hoare triple {5589#false} assume !false; {5589#false} is VALID [2018-11-23 11:52:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:52:37,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:52:37,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-11-23 11:52:37,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:37,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:52:37,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:52:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:52:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:37,157 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 11 states. [2018-11-23 11:52:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,635 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-11-23 11:52:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:37,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-11-23 11:52:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2018-11-23 11:52:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2018-11-23 11:52:37,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 104 transitions. [2018-11-23 11:52:37,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,750 INFO L225 Difference]: With dead ends: 270 [2018-11-23 11:52:37,750 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 11:52:37,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 11:52:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-11-23 11:52:37,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 146 states. [2018-11-23 11:52:37,817 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 146 states. [2018-11-23 11:52:37,818 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 146 states. [2018-11-23 11:52:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,821 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-23 11:52:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-11-23 11:52:37,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,822 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 147 states. [2018-11-23 11:52:37,822 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 147 states. [2018-11-23 11:52:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,826 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-23 11:52:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-11-23 11:52:37,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 11:52:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-11-23 11:52:37,830 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 139 [2018-11-23 11:52:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,830 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-11-23 11:52:37,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-11-23 11:52:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 11:52:37,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,832 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:37,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1670521780, now seen corresponding path program 8 times [2018-11-23 11:52:37,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {6928#true} call ULTIMATE.init(); {6928#true} is VALID [2018-11-23 11:52:38,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {6928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6928#true} is VALID [2018-11-23 11:52:38,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {6928#true} assume true; {6928#true} is VALID [2018-11-23 11:52:38,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6928#true} {6928#true} #147#return; {6928#true} is VALID [2018-11-23 11:52:38,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {6928#true} call #t~ret20 := main(); {6928#true} is VALID [2018-11-23 11:52:38,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {6928#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6930#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {6930#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6930#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {6930#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {6932#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {6932#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {6933#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {6933#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {6934#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {6934#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {6935#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {6935#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {6936#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {6936#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {6937#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {6937#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {6938#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {6929#false} havoc ~i~0;~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 37: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 49: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 50: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 52: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 54: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 55: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 56: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 57: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 58: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 61: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 66: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 71: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 72: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 73: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 74: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 75: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 76: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 77: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 78: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 79: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 80: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 81: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 82: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 83: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 84: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 85: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 86: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 87: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 88: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 89: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 90: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 92: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 93: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 94: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 95: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 96: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 97: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 99: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 100: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 101: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 102: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 103: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 104: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 105: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 106: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 107: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 108: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 109: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 110: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 111: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 112: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 113: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 114: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 115: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 116: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 117: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 118: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 119: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 120: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 121: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 122: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 123: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 124: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 125: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 126: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 127: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 128: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 129: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 130: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 131: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 132: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 133: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 134: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 135: Hoare triple {6929#false} havoc ~x~0;~x~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,216 INFO L273 TraceCheckUtils]: 136: Hoare triple {6929#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {6929#false} is VALID [2018-11-23 11:52:38,217 INFO L256 TraceCheckUtils]: 137: Hoare triple {6929#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {6929#false} is VALID [2018-11-23 11:52:38,217 INFO L273 TraceCheckUtils]: 138: Hoare triple {6929#false} ~cond := #in~cond; {6929#false} is VALID [2018-11-23 11:52:38,217 INFO L273 TraceCheckUtils]: 139: Hoare triple {6929#false} assume 0 == ~cond; {6929#false} is VALID [2018-11-23 11:52:38,217 INFO L273 TraceCheckUtils]: 140: Hoare triple {6929#false} assume !false; {6929#false} is VALID [2018-11-23 11:52:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:52:38,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:38,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:38,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:38,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:38,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {6928#true} call ULTIMATE.init(); {6928#true} is VALID [2018-11-23 11:52:38,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {6928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6928#true} is VALID [2018-11-23 11:52:38,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {6928#true} assume true; {6928#true} is VALID [2018-11-23 11:52:38,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6928#true} {6928#true} #147#return; {6928#true} is VALID [2018-11-23 11:52:38,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {6928#true} call #t~ret20 := main(); {6928#true} is VALID [2018-11-23 11:52:38,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {6928#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6957#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:38,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {6957#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6957#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:38,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {6957#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {6932#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {6932#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {6933#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {6933#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {6934#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {6934#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {6935#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {6935#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {6936#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {6936#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {6937#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {6937#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {6938#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {6929#false} havoc ~i~0;~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 32: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 37: Hoare triple {6929#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6929#false} is VALID [2018-11-23 11:52:38,549 INFO L273 TraceCheckUtils]: 38: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 52: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 53: Hoare triple {6929#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6929#false} is VALID [2018-11-23 11:52:38,551 INFO L273 TraceCheckUtils]: 54: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 56: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 57: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 58: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 59: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 60: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 61: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 62: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,552 INFO L273 TraceCheckUtils]: 63: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 64: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 65: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 66: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 67: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 68: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {6929#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 70: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,553 INFO L273 TraceCheckUtils]: 71: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 72: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 73: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 74: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 75: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 76: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 77: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 79: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,554 INFO L273 TraceCheckUtils]: 80: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 81: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 82: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 83: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 84: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 85: Hoare triple {6929#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 93: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 94: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 95: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 96: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,556 INFO L273 TraceCheckUtils]: 97: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 98: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 99: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 100: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 101: Hoare triple {6929#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 102: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 103: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 104: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,557 INFO L273 TraceCheckUtils]: 105: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 106: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 107: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 108: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 109: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 110: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 111: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 112: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,558 INFO L273 TraceCheckUtils]: 113: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 114: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 115: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 116: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 117: Hoare triple {6929#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 118: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 119: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 120: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 121: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,559 INFO L273 TraceCheckUtils]: 122: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 123: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 124: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 125: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 126: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 127: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 128: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 129: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,560 INFO L273 TraceCheckUtils]: 130: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 131: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 132: Hoare triple {6929#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 133: Hoare triple {6929#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 134: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 135: Hoare triple {6929#false} havoc ~x~0;~x~0 := 0; {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 136: Hoare triple {6929#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L256 TraceCheckUtils]: 137: Hoare triple {6929#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {6929#false} is VALID [2018-11-23 11:52:38,561 INFO L273 TraceCheckUtils]: 138: Hoare triple {6929#false} ~cond := #in~cond; {6929#false} is VALID [2018-11-23 11:52:38,562 INFO L273 TraceCheckUtils]: 139: Hoare triple {6929#false} assume 0 == ~cond; {6929#false} is VALID [2018-11-23 11:52:38,562 INFO L273 TraceCheckUtils]: 140: Hoare triple {6929#false} assume !false; {6929#false} is VALID [2018-11-23 11:52:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:52:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:38,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:38,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-11-23 11:52:38,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:38,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:38,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:38,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:38,653 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 12 states. [2018-11-23 11:52:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,148 INFO L93 Difference]: Finished difference Result 272 states and 288 transitions. [2018-11-23 11:52:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:40,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-11-23 11:52:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-23 11:52:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-23 11:52:40,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2018-11-23 11:52:40,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:40,747 INFO L225 Difference]: With dead ends: 272 [2018-11-23 11:52:40,747 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:52:40,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:52:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-11-23 11:52:41,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:41,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 148 states. [2018-11-23 11:52:41,010 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 148 states. [2018-11-23 11:52:41,010 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 148 states. [2018-11-23 11:52:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,014 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-23 11:52:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-11-23 11:52:41,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,015 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 149 states. [2018-11-23 11:52:41,015 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 149 states. [2018-11-23 11:52:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,018 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-23 11:52:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-11-23 11:52:41,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:41,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 11:52:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-11-23 11:52:41,022 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 141 [2018-11-23 11:52:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:41,022 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-11-23 11:52:41,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-11-23 11:52:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 11:52:41,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:41,024 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:41,024 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:41,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1171059478, now seen corresponding path program 9 times [2018-11-23 11:52:41,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:41,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:41,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {8285#true} call ULTIMATE.init(); {8285#true} is VALID [2018-11-23 11:52:41,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {8285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8285#true} is VALID [2018-11-23 11:52:41,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {8285#true} assume true; {8285#true} is VALID [2018-11-23 11:52:41,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8285#true} {8285#true} #147#return; {8285#true} is VALID [2018-11-23 11:52:41,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {8285#true} call #t~ret20 := main(); {8285#true} is VALID [2018-11-23 11:52:41,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {8285#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8287#(= main_~a~0 0)} is VALID [2018-11-23 11:52:41,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {8287#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8287#(= main_~a~0 0)} is VALID [2018-11-23 11:52:41,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {8287#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8288#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:41,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {8288#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8288#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:41,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {8288#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8289#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:41,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {8289#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8289#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:41,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {8289#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8290#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:41,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {8290#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8290#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:41,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {8290#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8291#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:41,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {8291#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8291#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:41,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {8291#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8292#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:41,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {8292#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8292#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:41,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {8292#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8293#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:41,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {8293#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8293#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:41,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {8293#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8294#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:41,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {8294#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8294#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:41,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {8294#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8295#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:41,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {8295#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8295#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:41,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {8295#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8296#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:41,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {8296#(<= main_~a~0 9)} assume !(~a~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {8286#false} havoc ~i~0;~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,455 INFO L273 TraceCheckUtils]: 38: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {8286#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 53: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,458 INFO L273 TraceCheckUtils]: 57: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 58: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 59: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 61: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 62: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,459 INFO L273 TraceCheckUtils]: 64: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 65: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 66: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 67: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 72: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 73: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 74: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 75: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 78: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 81: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 82: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,462 INFO L273 TraceCheckUtils]: 83: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 84: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 85: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 86: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 87: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 88: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 89: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,463 INFO L273 TraceCheckUtils]: 90: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 91: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 92: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 93: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 94: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 95: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,464 INFO L273 TraceCheckUtils]: 96: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 97: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 98: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 99: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 100: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 101: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 102: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:52:41,465 INFO L273 TraceCheckUtils]: 103: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 104: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 105: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 106: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 107: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 108: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,466 INFO L273 TraceCheckUtils]: 109: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 110: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 111: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 112: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 113: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 114: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 115: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,467 INFO L273 TraceCheckUtils]: 116: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 117: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 118: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 119: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 120: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 121: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,468 INFO L273 TraceCheckUtils]: 122: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 123: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 124: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 125: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 126: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 127: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 128: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,469 INFO L273 TraceCheckUtils]: 129: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 130: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 131: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 132: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 133: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 134: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:52:41,470 INFO L273 TraceCheckUtils]: 135: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L273 TraceCheckUtils]: 136: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L273 TraceCheckUtils]: 137: Hoare triple {8286#false} havoc ~x~0;~x~0 := 0; {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L273 TraceCheckUtils]: 138: Hoare triple {8286#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L256 TraceCheckUtils]: 139: Hoare triple {8286#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L273 TraceCheckUtils]: 140: Hoare triple {8286#false} ~cond := #in~cond; {8286#false} is VALID [2018-11-23 11:52:41,471 INFO L273 TraceCheckUtils]: 141: Hoare triple {8286#false} assume 0 == ~cond; {8286#false} is VALID [2018-11-23 11:52:41,472 INFO L273 TraceCheckUtils]: 142: Hoare triple {8286#false} assume !false; {8286#false} is VALID [2018-11-23 11:52:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:52:41,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:41,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:04,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:53:04,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:05,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {8285#true} call ULTIMATE.init(); {8285#true} is VALID [2018-11-23 11:53:05,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {8285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8285#true} is VALID [2018-11-23 11:53:05,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {8285#true} assume true; {8285#true} is VALID [2018-11-23 11:53:05,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8285#true} {8285#true} #147#return; {8285#true} is VALID [2018-11-23 11:53:05,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {8285#true} call #t~ret20 := main(); {8285#true} is VALID [2018-11-23 11:53:05,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {8285#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8285#true} is VALID [2018-11-23 11:53:05,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {8285#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8285#true} is VALID [2018-11-23 11:53:05,187 INFO L273 TraceCheckUtils]: 23: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 11:53:05,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {8285#true} assume !(~a~0 < 100000); {8285#true} is VALID [2018-11-23 11:53:05,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {8285#true} havoc ~i~0;~i~0 := 0; {8375#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:05,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {8375#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8375#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:05,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {8375#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8382#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:05,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {8382#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8382#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:05,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {8382#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8389#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:05,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {8389#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8389#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:05,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {8389#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8396#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:05,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {8396#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8396#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:05,190 INFO L273 TraceCheckUtils]: 33: Hoare triple {8396#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8403#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:05,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {8403#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8403#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:05,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {8403#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8410#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:05,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {8410#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8410#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:05,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {8410#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:05,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {8417#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:05,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {8417#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8424#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:05,195 INFO L273 TraceCheckUtils]: 40: Hoare triple {8424#(<= main_~i~0 7)} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,195 INFO L273 TraceCheckUtils]: 41: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,196 INFO L273 TraceCheckUtils]: 42: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,196 INFO L273 TraceCheckUtils]: 43: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,196 INFO L273 TraceCheckUtils]: 44: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,198 INFO L273 TraceCheckUtils]: 54: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8286#false} is VALID [2018-11-23 11:53:05,198 INFO L273 TraceCheckUtils]: 55: Hoare triple {8286#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#false} is VALID [2018-11-23 11:53:05,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,199 INFO L273 TraceCheckUtils]: 58: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,199 INFO L273 TraceCheckUtils]: 59: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,199 INFO L273 TraceCheckUtils]: 60: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,200 INFO L273 TraceCheckUtils]: 65: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 67: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 69: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {8286#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 72: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,201 INFO L273 TraceCheckUtils]: 73: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 77: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 78: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,202 INFO L273 TraceCheckUtils]: 79: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 80: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 81: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 82: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 83: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 84: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,203 INFO L273 TraceCheckUtils]: 85: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 86: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 87: Hoare triple {8286#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 89: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 90: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,204 INFO L273 TraceCheckUtils]: 91: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 92: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 93: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 94: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 95: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 96: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,205 INFO L273 TraceCheckUtils]: 97: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 98: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 99: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 100: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 101: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 102: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8286#false} is VALID [2018-11-23 11:53:05,206 INFO L273 TraceCheckUtils]: 103: Hoare triple {8286#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 104: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 105: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 106: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 107: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 108: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,207 INFO L273 TraceCheckUtils]: 109: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 110: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 111: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 112: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 113: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 114: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,208 INFO L273 TraceCheckUtils]: 115: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 116: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 117: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 118: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 119: Hoare triple {8286#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 120: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,209 INFO L273 TraceCheckUtils]: 121: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 122: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 123: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 124: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 125: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 126: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,210 INFO L273 TraceCheckUtils]: 127: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 128: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 129: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 130: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 131: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 132: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 133: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,211 INFO L273 TraceCheckUtils]: 134: Hoare triple {8286#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {8286#false} is VALID [2018-11-23 11:53:05,212 INFO L273 TraceCheckUtils]: 135: Hoare triple {8286#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8286#false} is VALID [2018-11-23 11:53:05,212 INFO L273 TraceCheckUtils]: 136: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:53:05,212 INFO L273 TraceCheckUtils]: 137: Hoare triple {8286#false} havoc ~x~0;~x~0 := 0; {8286#false} is VALID [2018-11-23 11:53:05,212 INFO L273 TraceCheckUtils]: 138: Hoare triple {8286#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {8286#false} is VALID [2018-11-23 11:53:05,212 INFO L256 TraceCheckUtils]: 139: Hoare triple {8286#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {8286#false} is VALID [2018-11-23 11:53:05,213 INFO L273 TraceCheckUtils]: 140: Hoare triple {8286#false} ~cond := #in~cond; {8286#false} is VALID [2018-11-23 11:53:05,213 INFO L273 TraceCheckUtils]: 141: Hoare triple {8286#false} assume 0 == ~cond; {8286#false} is VALID [2018-11-23 11:53:05,213 INFO L273 TraceCheckUtils]: 142: Hoare triple {8286#false} assume !false; {8286#false} is VALID [2018-11-23 11:53:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-23 11:53:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:05,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-23 11:53:05,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-11-23 11:53:05,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:05,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:53:05,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:05,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:53:05,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:53:05,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:53:05,357 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 20 states. [2018-11-23 11:53:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:07,149 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2018-11-23 11:53:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:53:07,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-11-23 11:53:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:53:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2018-11-23 11:53:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:53:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2018-11-23 11:53:07,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 227 transitions. [2018-11-23 11:53:07,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:07,861 INFO L225 Difference]: With dead ends: 295 [2018-11-23 11:53:07,861 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:53:07,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:53:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 11:53:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2018-11-23 11:53:07,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:07,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 164 states. [2018-11-23 11:53:07,945 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 164 states. [2018-11-23 11:53:07,945 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 164 states. [2018-11-23 11:53:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:07,950 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-11-23 11:53:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-11-23 11:53:07,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:07,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:07,951 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 172 states. [2018-11-23 11:53:07,951 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 172 states. [2018-11-23 11:53:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:07,955 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-11-23 11:53:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-11-23 11:53:07,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:07,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:07,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:07,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:53:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2018-11-23 11:53:07,960 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 143 [2018-11-23 11:53:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:07,960 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2018-11-23 11:53:07,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:53:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2018-11-23 11:53:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 11:53:07,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:07,962 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:07,963 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:07,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 743890138, now seen corresponding path program 10 times [2018-11-23 11:53:07,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:07,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {9757#true} call ULTIMATE.init(); {9757#true} is VALID [2018-11-23 11:53:08,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {9757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9757#true} is VALID [2018-11-23 11:53:08,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {9757#true} assume true; {9757#true} is VALID [2018-11-23 11:53:08,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9757#true} {9757#true} #147#return; {9757#true} is VALID [2018-11-23 11:53:08,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {9757#true} call #t~ret20 := main(); {9757#true} is VALID [2018-11-23 11:53:08,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {9757#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9759#(= main_~a~0 0)} is VALID [2018-11-23 11:53:08,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {9759#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9759#(= main_~a~0 0)} is VALID [2018-11-23 11:53:08,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {9759#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9760#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:08,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {9760#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9760#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:08,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {9760#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9761#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:08,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {9761#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9761#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:08,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {9761#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9762#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:08,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {9762#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9762#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:08,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {9762#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9763#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:08,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {9763#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9763#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:08,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {9763#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9764#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:08,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {9764#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9764#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:08,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {9764#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9765#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:08,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {9765#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9765#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:08,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {9765#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9766#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:08,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {9766#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9766#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:08,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {9766#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9767#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:08,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {9767#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9767#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:08,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {9767#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9768#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:08,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {9768#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9768#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:08,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {9768#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9769#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:08,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {9769#(<= main_~a~0 10)} assume !(~a~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {9758#false} havoc ~i~0;~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {9758#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {9758#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9758#false} is VALID [2018-11-23 11:53:08,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 64: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 70: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,969 INFO L273 TraceCheckUtils]: 71: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 73: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 75: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 76: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 79: Hoare triple {9758#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9758#false} is VALID [2018-11-23 11:53:08,970 INFO L273 TraceCheckUtils]: 80: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 84: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 85: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 86: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,971 INFO L273 TraceCheckUtils]: 88: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 89: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 91: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 92: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 94: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9758#false} is VALID [2018-11-23 11:53:08,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {9758#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 98: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 100: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 102: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 105: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,973 INFO L273 TraceCheckUtils]: 106: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 107: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 108: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 109: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 110: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 111: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 112: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 113: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,974 INFO L273 TraceCheckUtils]: 114: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 115: Hoare triple {9758#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 116: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 117: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 118: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 119: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 120: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 121: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 122: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,975 INFO L273 TraceCheckUtils]: 123: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 124: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 125: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 126: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 127: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 128: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 129: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 130: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 131: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,976 INFO L273 TraceCheckUtils]: 132: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 133: Hoare triple {9758#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 134: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 135: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 136: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 137: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 138: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 139: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,977 INFO L273 TraceCheckUtils]: 140: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 141: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 142: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 143: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 144: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 145: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 146: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 147: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 148: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,978 INFO L273 TraceCheckUtils]: 149: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 150: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 151: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 152: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 153: Hoare triple {9758#false} havoc ~x~0;~x~0 := 0; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 154: Hoare triple {9758#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L256 TraceCheckUtils]: 155: Hoare triple {9758#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 156: Hoare triple {9758#false} ~cond := #in~cond; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 157: Hoare triple {9758#false} assume 0 == ~cond; {9758#false} is VALID [2018-11-23 11:53:08,979 INFO L273 TraceCheckUtils]: 158: Hoare triple {9758#false} assume !false; {9758#false} is VALID [2018-11-23 11:53:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-23 11:53:08,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:08,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:09,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:09,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:09,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:09,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {9757#true} call ULTIMATE.init(); {9757#true} is VALID [2018-11-23 11:53:09,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {9757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9757#true} is VALID [2018-11-23 11:53:09,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {9757#true} assume true; {9757#true} is VALID [2018-11-23 11:53:09,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9757#true} {9757#true} #147#return; {9757#true} is VALID [2018-11-23 11:53:09,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {9757#true} call #t~ret20 := main(); {9757#true} is VALID [2018-11-23 11:53:09,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {9757#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {9757#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {9757#true} assume !(~a~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {9757#true} havoc ~i~0;~i~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 33: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 41: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 42: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {9757#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 47: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 50: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 55: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 56: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 57: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {9757#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 67: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 70: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 76: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {9757#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9757#true} is VALID [2018-11-23 11:53:09,431 INFO L273 TraceCheckUtils]: 80: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 82: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 86: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 87: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 88: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,432 INFO L273 TraceCheckUtils]: 89: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 90: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 91: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 94: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 95: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 96: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 97: Hoare triple {9757#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9757#true} is VALID [2018-11-23 11:53:09,433 INFO L273 TraceCheckUtils]: 98: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 99: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 100: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 101: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 102: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 103: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 104: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 105: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,434 INFO L273 TraceCheckUtils]: 106: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 107: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 108: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 109: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 110: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 111: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 112: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 113: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 114: Hoare triple {9757#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9757#true} is VALID [2018-11-23 11:53:09,435 INFO L273 TraceCheckUtils]: 115: Hoare triple {9757#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9757#true} is VALID [2018-11-23 11:53:09,436 INFO L273 TraceCheckUtils]: 116: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 11:53:09,436 INFO L273 TraceCheckUtils]: 117: Hoare triple {9757#true} ~i~0 := 0; {10124#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:09,436 INFO L273 TraceCheckUtils]: 118: Hoare triple {10124#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10124#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:09,437 INFO L273 TraceCheckUtils]: 119: Hoare triple {10124#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10131#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:09,437 INFO L273 TraceCheckUtils]: 120: Hoare triple {10131#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10131#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:09,438 INFO L273 TraceCheckUtils]: 121: Hoare triple {10131#(<= main_~i~0 1)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10138#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:09,438 INFO L273 TraceCheckUtils]: 122: Hoare triple {10138#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10138#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:09,439 INFO L273 TraceCheckUtils]: 123: Hoare triple {10138#(<= main_~i~0 2)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10145#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:09,439 INFO L273 TraceCheckUtils]: 124: Hoare triple {10145#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10145#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:09,440 INFO L273 TraceCheckUtils]: 125: Hoare triple {10145#(<= main_~i~0 3)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10152#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:09,440 INFO L273 TraceCheckUtils]: 126: Hoare triple {10152#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10152#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:09,441 INFO L273 TraceCheckUtils]: 127: Hoare triple {10152#(<= main_~i~0 4)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10159#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:09,442 INFO L273 TraceCheckUtils]: 128: Hoare triple {10159#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10159#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:09,442 INFO L273 TraceCheckUtils]: 129: Hoare triple {10159#(<= main_~i~0 5)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10166#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:09,443 INFO L273 TraceCheckUtils]: 130: Hoare triple {10166#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10166#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:09,444 INFO L273 TraceCheckUtils]: 131: Hoare triple {10166#(<= main_~i~0 6)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10173#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:09,444 INFO L273 TraceCheckUtils]: 132: Hoare triple {10173#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10173#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:09,445 INFO L273 TraceCheckUtils]: 133: Hoare triple {10173#(<= main_~i~0 7)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10180#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:09,446 INFO L273 TraceCheckUtils]: 134: Hoare triple {10180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:09,446 INFO L273 TraceCheckUtils]: 135: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 11:53:09,446 INFO L273 TraceCheckUtils]: 136: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,446 INFO L273 TraceCheckUtils]: 137: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,447 INFO L273 TraceCheckUtils]: 138: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,447 INFO L273 TraceCheckUtils]: 139: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,447 INFO L273 TraceCheckUtils]: 140: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,447 INFO L273 TraceCheckUtils]: 141: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,447 INFO L273 TraceCheckUtils]: 142: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,448 INFO L273 TraceCheckUtils]: 143: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,448 INFO L273 TraceCheckUtils]: 144: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,448 INFO L273 TraceCheckUtils]: 145: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,448 INFO L273 TraceCheckUtils]: 146: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,448 INFO L273 TraceCheckUtils]: 147: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,449 INFO L273 TraceCheckUtils]: 148: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,449 INFO L273 TraceCheckUtils]: 149: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,449 INFO L273 TraceCheckUtils]: 150: Hoare triple {9758#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9758#false} is VALID [2018-11-23 11:53:09,449 INFO L273 TraceCheckUtils]: 151: Hoare triple {9758#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9758#false} is VALID [2018-11-23 11:53:09,449 INFO L273 TraceCheckUtils]: 152: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 11:53:09,450 INFO L273 TraceCheckUtils]: 153: Hoare triple {9758#false} havoc ~x~0;~x~0 := 0; {9758#false} is VALID [2018-11-23 11:53:09,450 INFO L273 TraceCheckUtils]: 154: Hoare triple {9758#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {9758#false} is VALID [2018-11-23 11:53:09,450 INFO L256 TraceCheckUtils]: 155: Hoare triple {9758#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {9758#false} is VALID [2018-11-23 11:53:09,450 INFO L273 TraceCheckUtils]: 156: Hoare triple {9758#false} ~cond := #in~cond; {9758#false} is VALID [2018-11-23 11:53:09,450 INFO L273 TraceCheckUtils]: 157: Hoare triple {9758#false} assume 0 == ~cond; {9758#false} is VALID [2018-11-23 11:53:09,451 INFO L273 TraceCheckUtils]: 158: Hoare triple {9758#false} assume !false; {9758#false} is VALID [2018-11-23 11:53:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 11:53:09,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:09,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 11:53:09,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-11-23 11:53:09,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:09,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:53:09,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:09,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:53:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:53:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:09,626 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand 22 states. [2018-11-23 11:53:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:11,147 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2018-11-23 11:53:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:53:11,148 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-11-23 11:53:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2018-11-23 11:53:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2018-11-23 11:53:11,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 243 transitions. [2018-11-23 11:53:11,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:11,836 INFO L225 Difference]: With dead ends: 325 [2018-11-23 11:53:11,836 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 11:53:11,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 11:53:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-11-23 11:53:11,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:11,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 180 states. [2018-11-23 11:53:11,930 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 180 states. [2018-11-23 11:53:11,930 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 180 states. [2018-11-23 11:53:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:11,937 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 11:53:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2018-11-23 11:53:11,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:11,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:11,938 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 188 states. [2018-11-23 11:53:11,938 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 188 states. [2018-11-23 11:53:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:11,944 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 11:53:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2018-11-23 11:53:11,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:11,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:11,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:11,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 11:53:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 188 transitions. [2018-11-23 11:53:11,951 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 188 transitions. Word has length 159 [2018-11-23 11:53:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:11,951 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 188 transitions. [2018-11-23 11:53:11,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:53:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2018-11-23 11:53:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 11:53:11,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:11,954 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:11,954 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:11,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1615098678, now seen corresponding path program 11 times [2018-11-23 11:53:11,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:11,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:12,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {11380#true} call ULTIMATE.init(); {11380#true} is VALID [2018-11-23 11:53:12,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {11380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11380#true} is VALID [2018-11-23 11:53:12,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {11380#true} assume true; {11380#true} is VALID [2018-11-23 11:53:12,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11380#true} {11380#true} #147#return; {11380#true} is VALID [2018-11-23 11:53:12,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {11380#true} call #t~ret20 := main(); {11380#true} is VALID [2018-11-23 11:53:12,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {11380#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11382#(= main_~a~0 0)} is VALID [2018-11-23 11:53:12,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {11382#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11382#(= main_~a~0 0)} is VALID [2018-11-23 11:53:12,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {11382#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11383#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:12,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {11383#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11383#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:12,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {11383#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11384#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:12,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {11384#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11384#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:12,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {11384#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11385#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:12,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {11385#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11385#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:12,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {11385#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11386#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:12,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {11386#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11386#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:12,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {11386#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11387#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:12,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {11387#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11387#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:12,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {11387#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11388#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:12,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {11388#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11388#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:12,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {11388#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11389#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:12,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {11389#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11389#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:12,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {11389#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11390#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:12,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {11390#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11390#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:12,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {11390#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11391#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:12,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {11391#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11391#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:12,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {11391#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11392#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:12,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {11392#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11392#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:12,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {11392#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11393#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:12,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {11393#(<= main_~a~0 11)} assume !(~a~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {11381#false} havoc ~i~0;~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,760 INFO L273 TraceCheckUtils]: 37: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,762 INFO L273 TraceCheckUtils]: 45: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11381#false} is VALID [2018-11-23 11:53:12,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {11381#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11381#false} is VALID [2018-11-23 11:53:12,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 56: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 63: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 64: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 65: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 66: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 67: Hoare triple {11381#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 68: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 71: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,765 INFO L273 TraceCheckUtils]: 74: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 76: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 77: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 78: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 79: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 80: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 82: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 83: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 84: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 85: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 86: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 87: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 90: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,767 INFO L273 TraceCheckUtils]: 91: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 92: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 93: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 94: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 95: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 96: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 97: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 99: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 100: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 101: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 102: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 103: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 104: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 105: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 106: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 107: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 108: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 109: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 110: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 111: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 112: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 113: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 114: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 115: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 116: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,770 INFO L273 TraceCheckUtils]: 117: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 118: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 119: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 120: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 121: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 122: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 123: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 124: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 125: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 126: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 127: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 128: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 129: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 130: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 131: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 132: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 133: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 134: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,772 INFO L273 TraceCheckUtils]: 135: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 136: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 137: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 138: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 139: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 140: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 141: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 142: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 143: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 144: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 145: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 146: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 147: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 148: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 149: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 150: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 151: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,774 INFO L273 TraceCheckUtils]: 152: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 153: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 154: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 155: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 156: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 157: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 158: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 159: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 160: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 161: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 162: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 163: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 164: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 165: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 166: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 167: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 168: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 169: Hoare triple {11381#false} havoc ~x~0;~x~0 := 0; {11381#false} is VALID [2018-11-23 11:53:12,776 INFO L273 TraceCheckUtils]: 170: Hoare triple {11381#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {11381#false} is VALID [2018-11-23 11:53:12,777 INFO L256 TraceCheckUtils]: 171: Hoare triple {11381#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {11381#false} is VALID [2018-11-23 11:53:12,777 INFO L273 TraceCheckUtils]: 172: Hoare triple {11381#false} ~cond := #in~cond; {11381#false} is VALID [2018-11-23 11:53:12,777 INFO L273 TraceCheckUtils]: 173: Hoare triple {11381#false} assume 0 == ~cond; {11381#false} is VALID [2018-11-23 11:53:12,777 INFO L273 TraceCheckUtils]: 174: Hoare triple {11381#false} assume !false; {11381#false} is VALID [2018-11-23 11:53:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-11-23 11:53:12,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:12,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:37,912 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:54:37,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:37,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:38,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {11380#true} call ULTIMATE.init(); {11380#true} is VALID [2018-11-23 11:54:38,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {11380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11380#true} is VALID [2018-11-23 11:54:38,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {11380#true} assume true; {11380#true} is VALID [2018-11-23 11:54:38,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11380#true} {11380#true} #147#return; {11380#true} is VALID [2018-11-23 11:54:38,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {11380#true} call #t~ret20 := main(); {11380#true} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {11380#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11380#true} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {11380#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {11380#true} assume !(~a~0 < 100000); {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {11380#true} havoc ~i~0;~i~0 := 0; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,296 INFO L273 TraceCheckUtils]: 35: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 37: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 41: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,297 INFO L273 TraceCheckUtils]: 43: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {11380#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {11380#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {11380#true} assume !(~i~0 < 100000); {11380#true} is VALID [2018-11-23 11:54:38,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {11380#true} ~i~0 := 0; {11544#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:38,299 INFO L273 TraceCheckUtils]: 50: Hoare triple {11544#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11544#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:38,299 INFO L273 TraceCheckUtils]: 51: Hoare triple {11544#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11551#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:38,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {11551#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11551#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:38,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {11551#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11558#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:38,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {11558#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11558#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:38,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {11558#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11565#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:38,302 INFO L273 TraceCheckUtils]: 56: Hoare triple {11565#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11565#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:38,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {11565#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11572#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:38,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {11572#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11572#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:38,304 INFO L273 TraceCheckUtils]: 59: Hoare triple {11572#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11579#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:38,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {11579#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11579#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:38,305 INFO L273 TraceCheckUtils]: 61: Hoare triple {11579#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11586#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:38,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {11586#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11586#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:38,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {11586#(<= main_~i~0 6)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11593#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:38,307 INFO L273 TraceCheckUtils]: 64: Hoare triple {11593#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11593#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:38,308 INFO L273 TraceCheckUtils]: 65: Hoare triple {11593#(<= main_~i~0 7)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11600#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:38,308 INFO L273 TraceCheckUtils]: 66: Hoare triple {11600#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11600#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:38,309 INFO L273 TraceCheckUtils]: 67: Hoare triple {11600#(<= main_~i~0 8)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {11607#(<= main_~i~0 9)} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 69: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 70: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 71: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,310 INFO L273 TraceCheckUtils]: 72: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 73: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 74: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 75: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,311 INFO L273 TraceCheckUtils]: 76: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 77: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 78: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 79: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 80: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 81: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,312 INFO L273 TraceCheckUtils]: 82: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 83: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 85: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 86: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11381#false} is VALID [2018-11-23 11:54:38,313 INFO L273 TraceCheckUtils]: 87: Hoare triple {11381#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 88: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 89: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 90: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 91: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 92: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 93: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 94: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 96: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 99: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 100: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 103: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,315 INFO L273 TraceCheckUtils]: 104: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 105: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 106: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 107: Hoare triple {11381#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 108: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 109: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 110: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 111: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 112: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,316 INFO L273 TraceCheckUtils]: 113: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 114: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 115: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 116: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 117: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 118: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 119: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 120: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,317 INFO L273 TraceCheckUtils]: 121: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 122: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 123: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 124: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 125: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 126: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 127: Hoare triple {11381#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 128: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 129: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,318 INFO L273 TraceCheckUtils]: 130: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 131: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 132: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 133: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 134: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 135: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 136: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 137: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 138: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,319 INFO L273 TraceCheckUtils]: 139: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 140: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 141: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 142: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 143: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 144: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 145: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 147: Hoare triple {11381#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11381#false} is VALID [2018-11-23 11:54:38,320 INFO L273 TraceCheckUtils]: 148: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 149: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 150: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 151: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 152: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 153: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 154: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 155: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,321 INFO L273 TraceCheckUtils]: 156: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 157: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 158: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 159: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 160: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 161: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 162: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 163: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 164: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,322 INFO L273 TraceCheckUtils]: 165: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 166: Hoare triple {11381#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 167: Hoare triple {11381#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 168: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 169: Hoare triple {11381#false} havoc ~x~0;~x~0 := 0; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 170: Hoare triple {11381#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L256 TraceCheckUtils]: 171: Hoare triple {11381#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 172: Hoare triple {11381#false} ~cond := #in~cond; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 173: Hoare triple {11381#false} assume 0 == ~cond; {11381#false} is VALID [2018-11-23 11:54:38,323 INFO L273 TraceCheckUtils]: 174: Hoare triple {11381#false} assume !false; {11381#false} is VALID [2018-11-23 11:54:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-23 11:54:38,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:38,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-23 11:54:38,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-23 11:54:38,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:38,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:54:38,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:38,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:54:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:54:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:54:38,459 INFO L87 Difference]: Start difference. First operand 180 states and 188 transitions. Second operand 24 states. [2018-11-23 11:54:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:39,600 INFO L93 Difference]: Finished difference Result 355 states and 378 transitions. [2018-11-23 11:54:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:54:39,600 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-23 11:54:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 259 transitions. [2018-11-23 11:54:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 259 transitions. [2018-11-23 11:54:39,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 259 transitions. [2018-11-23 11:54:40,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:40,798 INFO L225 Difference]: With dead ends: 355 [2018-11-23 11:54:40,799 INFO L226 Difference]: Without dead ends: 204 [2018-11-23 11:54:40,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:54:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-23 11:54:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-11-23 11:54:40,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:40,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 196 states. [2018-11-23 11:54:40,902 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 196 states. [2018-11-23 11:54:40,903 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 196 states. [2018-11-23 11:54:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:40,908 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-11-23 11:54:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 212 transitions. [2018-11-23 11:54:40,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:40,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:40,909 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 204 states. [2018-11-23 11:54:40,909 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 204 states. [2018-11-23 11:54:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:40,914 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-11-23 11:54:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 212 transitions. [2018-11-23 11:54:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:40,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:40,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 11:54:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2018-11-23 11:54:40,919 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 175 [2018-11-23 11:54:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:40,920 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2018-11-23 11:54:40,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:54:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2018-11-23 11:54:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-23 11:54:40,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:40,922 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:40,923 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:40,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1310647110, now seen corresponding path program 12 times [2018-11-23 11:54:40,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:40,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:41,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {13154#true} call ULTIMATE.init(); {13154#true} is VALID [2018-11-23 11:54:41,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {13154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13154#true} is VALID [2018-11-23 11:54:41,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {13154#true} assume true; {13154#true} is VALID [2018-11-23 11:54:41,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13154#true} {13154#true} #147#return; {13154#true} is VALID [2018-11-23 11:54:41,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {13154#true} call #t~ret20 := main(); {13154#true} is VALID [2018-11-23 11:54:41,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {13154#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13156#(= main_~a~0 0)} is VALID [2018-11-23 11:54:41,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {13156#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13156#(= main_~a~0 0)} is VALID [2018-11-23 11:54:41,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {13156#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13157#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:41,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {13157#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13157#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:41,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {13157#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13158#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:41,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {13158#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13158#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:41,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {13158#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13159#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:41,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {13159#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13159#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:41,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {13159#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13160#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:41,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {13160#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13160#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:41,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {13160#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13161#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:41,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {13161#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13161#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:41,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {13161#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13162#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:41,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {13162#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13162#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:41,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {13162#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13163#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:41,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {13163#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13163#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:41,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {13163#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13164#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:41,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {13164#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13164#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:41,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {13164#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13165#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:41,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {13165#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13165#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:41,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {13165#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13166#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:41,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {13166#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13166#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:41,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {13166#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13167#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:41,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {13167#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a7~0.base, ~#a7~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13167#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:41,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {13167#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13168#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:41,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {13168#(<= main_~a~0 12)} assume !(~a~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {13155#false} havoc ~i~0;~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 45: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {13155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 52: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,690 INFO L273 TraceCheckUtils]: 55: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 57: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 58: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 59: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 60: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 64: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 65: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 66: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 67: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,692 INFO L273 TraceCheckUtils]: 70: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 71: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 72: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 73: Hoare triple {13155#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 74: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 75: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 76: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 79: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 80: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 81: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 83: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,694 INFO L273 TraceCheckUtils]: 87: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 92: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 93: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 94: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 95: Hoare triple {13155#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13155#false} is VALID [2018-11-23 11:54:41,695 INFO L273 TraceCheckUtils]: 96: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 98: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 101: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 102: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 103: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 104: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,696 INFO L273 TraceCheckUtils]: 105: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 106: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 107: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 108: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 109: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 110: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 111: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 112: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,697 INFO L273 TraceCheckUtils]: 113: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 114: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 115: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 116: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 117: Hoare triple {13155#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 118: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 119: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 120: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 121: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,698 INFO L273 TraceCheckUtils]: 122: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 123: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 124: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 125: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 126: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 127: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 128: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 129: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 130: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,699 INFO L273 TraceCheckUtils]: 131: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 132: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 133: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 134: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 135: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 136: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 137: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 138: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 139: Hoare triple {13155#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13155#false} is VALID [2018-11-23 11:54:41,700 INFO L273 TraceCheckUtils]: 140: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 141: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 142: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 143: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 144: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 145: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 146: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 147: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 148: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,701 INFO L273 TraceCheckUtils]: 149: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 150: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 151: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 152: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 153: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 154: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 155: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 156: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,702 INFO L273 TraceCheckUtils]: 157: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 158: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 159: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 160: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 161: Hoare triple {13155#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 162: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 163: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 164: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 165: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,703 INFO L273 TraceCheckUtils]: 166: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 167: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 168: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 169: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 170: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 171: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 172: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 173: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 174: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,704 INFO L273 TraceCheckUtils]: 175: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 176: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 177: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 178: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 179: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 180: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 181: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 182: Hoare triple {13155#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {13155#false} is VALID [2018-11-23 11:54:41,705 INFO L273 TraceCheckUtils]: 183: Hoare triple {13155#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 184: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 185: Hoare triple {13155#false} havoc ~x~0;~x~0 := 0; {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 186: Hoare triple {13155#false} assume !!(~x~0 < 100000);call #t~mem18 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem19 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L256 TraceCheckUtils]: 187: Hoare triple {13155#false} call __VERIFIER_assert((if #t~mem18 == #t~mem19 then 1 else 0)); {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 188: Hoare triple {13155#false} ~cond := #in~cond; {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 189: Hoare triple {13155#false} assume 0 == ~cond; {13155#false} is VALID [2018-11-23 11:54:41,706 INFO L273 TraceCheckUtils]: 190: Hoare triple {13155#false} assume !false; {13155#false} is VALID [2018-11-23 11:54:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-23 11:54:41,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:41,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:41,731 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE