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_copy9_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,330 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,331 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,349 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,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,365 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,366 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,368 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,432 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_false-unreach-call_ground.i [2018-11-23 11:51:45,498 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130ed6056/27c068ad5fcc4b3e92c48bd030732848/FLAG59938c2a4 [2018-11-23 11:51:45,940 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,941 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_false-unreach-call_ground.i [2018-11-23 11:51:45,948 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130ed6056/27c068ad5fcc4b3e92c48bd030732848/FLAG59938c2a4 [2018-11-23 11:51:46,271 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130ed6056/27c068ad5fcc4b3e92c48bd030732848 [2018-11-23 11:51:46,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,287 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,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59565e5 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,292 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,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,332 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,606 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,671 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,702 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,703 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,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,714 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,727 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,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,758 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,759 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,762 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,762 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,800 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,816 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,818 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,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,824 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,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,153 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,153 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 11:51:48,154 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,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,158 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,159 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,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792133f4 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,160 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,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792133f4 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,160 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,162 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy9_false-unreach-call_ground.i [2018-11-23 11:51:48,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,228 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,229 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,229 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 11:51:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:48,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,260 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash -178932642, now seen corresponding path program 1 times [2018-11-23 11:51:48,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 11:51:48,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54#true} is VALID [2018-11-23 11:51:48,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 11:51:48,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #175#return; {54#true} is VALID [2018-11-23 11:51:48,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret24 := main(); {54#true} is VALID [2018-11-23 11:51:48,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {54#true} is VALID [2018-11-23 11:51:48,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {54#true} assume !true; {55#false} is VALID [2018-11-23 11:51:48,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#false} havoc ~i~0;~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 11:51:48,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {55#false} havoc ~x~0;~x~0 := 0; {55#false} is VALID [2018-11-23 11:51:48,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {55#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {55#false} is VALID [2018-11-23 11:51:48,490 INFO L256 TraceCheckUtils]: 27: Hoare triple {55#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {55#false} is VALID [2018-11-23 11:51:48,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2018-11-23 11:51:48,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2018-11-23 11:51:48,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 11:51:48,497 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,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 11:51:48,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,637 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-23 11:51:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,853 INFO L93 Difference]: Finished difference Result 94 states and 137 transitions. [2018-11-23 11:51:48,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,853 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 11:51:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-23 11:51:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-23 11:51:48,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 137 transitions. [2018-11-23 11:51:49,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,545 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:51:49,546 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:51:49,549 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,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:51:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:51:49,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:51:49,605 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:51:49,606 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:51:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,611 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 11:51:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 11:51:49,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,613 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:51:49,613 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:51:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,618 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 11:51:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 11:51:49,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:51:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 11:51:49,627 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2018-11-23 11:51:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,627 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 11:51:49,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 11:51:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:49,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1311438022, now seen corresponding path program 1 times [2018-11-23 11:51:49,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 11:51:49,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 11:51:49,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 11:51:49,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #175#return; {336#true} is VALID [2018-11-23 11:51:49,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret24 := main(); {336#true} is VALID [2018-11-23 11:51:49,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {338#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~a~0 0)} assume !(~a~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#false} havoc ~i~0;~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 11:51:49,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {337#false} havoc ~x~0;~x~0 := 0; {337#false} is VALID [2018-11-23 11:51:49,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {337#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {337#false} is VALID [2018-11-23 11:51:49,747 INFO L256 TraceCheckUtils]: 27: Hoare triple {337#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {337#false} is VALID [2018-11-23 11:51:49,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2018-11-23 11:51:49,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2018-11-23 11:51:49,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 11:51:49,750 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,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:51:49,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,856 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-11-23 11:51:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,157 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-11-23 11:51:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:51:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 11:51:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 11:51:50,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 11:51:50,419 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:51:50,423 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:51:50,423 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:51:50,424 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,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:51:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 11:51:50,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 11:51:50,456 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 11:51:50,457 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 11:51:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,460 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 11:51:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 11:51:50,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,462 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 11:51:50,462 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 11:51:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,465 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 11:51:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 11:51:50,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:51:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 11:51:50,470 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2018-11-23 11:51:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,470 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 11:51:50,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 11:51:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:51:50,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,472 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] [2018-11-23 11:51:50,472 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -953933084, now seen corresponding path program 1 times [2018-11-23 11:51:50,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2018-11-23 11:51:50,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {618#true} is VALID [2018-11-23 11:51:50,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-23 11:51:50,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} #175#return; {618#true} is VALID [2018-11-23 11:51:50,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {618#true} call #t~ret24 := main(); {618#true} is VALID [2018-11-23 11:51:50,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {618#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {618#true} is VALID [2018-11-23 11:51:50,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {618#true} is VALID [2018-11-23 11:51:50,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {618#true} is VALID [2018-11-23 11:51:50,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#true} assume !(~a~0 < 100000); {618#true} is VALID [2018-11-23 11:51:50,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {618#true} havoc ~i~0;~i~0 := 0; {620#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(= main_~i~0 0)} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 11:51:50,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {619#false} havoc ~x~0;~x~0 := 0; {619#false} is VALID [2018-11-23 11:51:50,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {619#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {619#false} is VALID [2018-11-23 11:51:50,591 INFO L256 TraceCheckUtils]: 29: Hoare triple {619#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {619#false} is VALID [2018-11-23 11:51:50,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2018-11-23 11:51:50,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {619#false} assume 0 == ~cond; {619#false} is VALID [2018-11-23 11:51:50,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {619#false} assume !false; {619#false} is VALID [2018-11-23 11:51:50,596 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,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 11:51:50,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,700 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 3 states. [2018-11-23 11:51:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,986 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2018-11-23 11:51:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 11:51:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 11:51:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 11:51:50,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 11:51:51,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,155 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:51:51,155 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:51:51,156 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,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:51:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-23 11:51:51,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 56 states. [2018-11-23 11:51:51,214 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 56 states. [2018-11-23 11:51:51,214 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 56 states. [2018-11-23 11:51:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,217 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 11:51:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 11:51:51,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,219 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 65 states. [2018-11-23 11:51:51,219 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 65 states. [2018-11-23 11:51:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,222 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 11:51:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 11:51:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:51:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-23 11:51:51,227 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 33 [2018-11-23 11:51:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,227 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-23 11:51:51,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-23 11:51:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:51:51,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,229 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -753251022, now seen corresponding path program 1 times [2018-11-23 11:51:51,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 11:51:51,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 11:51:51,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 11:51:51,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #175#return; {974#true} is VALID [2018-11-23 11:51:51,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret24 := main(); {974#true} is VALID [2018-11-23 11:51:51,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {976#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {976#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {976#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {976#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {977#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {977#(<= main_~a~0 1)} assume !(~a~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {975#false} havoc ~i~0;~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {975#false} is VALID [2018-11-23 11:51:51,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {975#false} is VALID [2018-11-23 11:51:51,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {975#false} is VALID [2018-11-23 11:51:51,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,385 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {975#false} is VALID [2018-11-23 11:51:51,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {975#false} is VALID [2018-11-23 11:51:51,387 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {975#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {975#false} is VALID [2018-11-23 11:51:51,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {975#false} is VALID [2018-11-23 11:51:51,388 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {975#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {975#false} is VALID [2018-11-23 11:51:51,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {975#false} is VALID [2018-11-23 11:51:51,390 INFO L273 TraceCheckUtils]: 39: Hoare triple {975#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {975#false} is VALID [2018-11-23 11:51:51,391 INFO L273 TraceCheckUtils]: 40: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,391 INFO L273 TraceCheckUtils]: 41: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {975#false} is VALID [2018-11-23 11:51:51,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {975#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {975#false} is VALID [2018-11-23 11:51:51,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {975#false} havoc ~x~0;~x~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {975#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {975#false} is VALID [2018-11-23 11:51:51,393 INFO L256 TraceCheckUtils]: 47: Hoare triple {975#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {975#false} is VALID [2018-11-23 11:51:51,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {975#false} ~cond := #in~cond; {975#false} is VALID [2018-11-23 11:51:51,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {975#false} assume 0 == ~cond; {975#false} is VALID [2018-11-23 11:51:51,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 11:51:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:51:51,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,399 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,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 11:51:51,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 11:51:51,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 11:51:51,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #175#return; {974#true} is VALID [2018-11-23 11:51:51,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret24 := main(); {974#true} is VALID [2018-11-23 11:51:51,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {996#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {996#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {996#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {996#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {977#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {977#(<= main_~a~0 1)} assume !(~a~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {975#false} havoc ~i~0;~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {975#false} is VALID [2018-11-23 11:51:51,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {975#false} is VALID [2018-11-23 11:51:51,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {975#false} is VALID [2018-11-23 11:51:51,805 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {975#false} is VALID [2018-11-23 11:51:51,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {975#false} is VALID [2018-11-23 11:51:51,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {975#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {975#false} is VALID [2018-11-23 11:51:51,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {975#false} is VALID [2018-11-23 11:51:51,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#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; {975#false} is VALID [2018-11-23 11:51:51,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {975#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {975#false} is VALID [2018-11-23 11:51:51,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,809 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {975#false} is VALID [2018-11-23 11:51:51,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {975#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {975#false} is VALID [2018-11-23 11:51:51,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {975#false} is VALID [2018-11-23 11:51:51,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {975#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {975#false} is VALID [2018-11-23 11:51:51,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 11:51:51,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {975#false} havoc ~x~0;~x~0 := 0; {975#false} is VALID [2018-11-23 11:51:51,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {975#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {975#false} is VALID [2018-11-23 11:51:51,811 INFO L256 TraceCheckUtils]: 47: Hoare triple {975#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {975#false} is VALID [2018-11-23 11:51:51,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {975#false} ~cond := #in~cond; {975#false} is VALID [2018-11-23 11:51:51,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {975#false} assume 0 == ~cond; {975#false} is VALID [2018-11-23 11:51:51,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 11:51:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:51:51,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:51,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-23 11:51:51,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:52,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:52,103 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-11-23 11:51:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,334 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2018-11-23 11:51:52,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:52,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-23 11:51:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2018-11-23 11:51:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2018-11-23 11:51:52,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2018-11-23 11:51:52,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,551 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:51:52,551 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:51:52,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:51:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 11:51:52,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:52,579 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:52,579 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,583 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 11:51:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 11:51:52,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,584 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:52,584 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,587 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 11:51:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 11:51:52,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:51:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 11:51:52,591 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 51 [2018-11-23 11:51:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,592 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 11:51:52,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 11:51:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:51:52,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,594 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash 194854992, now seen corresponding path program 2 times [2018-11-23 11:51:52,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:52,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2018-11-23 11:51:52,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1490#true} is VALID [2018-11-23 11:51:52,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2018-11-23 11:51:52,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #175#return; {1490#true} is VALID [2018-11-23 11:51:52,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret24 := main(); {1490#true} is VALID [2018-11-23 11:51:52,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {1490#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1492#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {1492#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1492#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {1492#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1493#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {1493#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1493#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {1493#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1494#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {1494#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {1491#false} havoc ~i~0;~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {1491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1491#false} is VALID [2018-11-23 11:51:52,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {1491#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1491#false} is VALID [2018-11-23 11:51:52,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {1491#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1491#false} is VALID [2018-11-23 11:51:52,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {1491#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1491#false} is VALID [2018-11-23 11:51:52,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {1491#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1491#false} is VALID [2018-11-23 11:51:52,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {1491#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1491#false} is VALID [2018-11-23 11:51:52,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {1491#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1491#false} is VALID [2018-11-23 11:51:52,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:52,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {1491#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1491#false} is VALID [2018-11-23 11:51:52,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1491#false} is VALID [2018-11-23 11:51:52,784 INFO L273 TraceCheckUtils]: 41: Hoare triple {1491#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1491#false} is VALID [2018-11-23 11:51:52,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,784 INFO L273 TraceCheckUtils]: 43: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {1491#false} is VALID [2018-11-23 11:51:52,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {1491#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {1491#false} is VALID [2018-11-23 11:51:52,785 INFO L273 TraceCheckUtils]: 46: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:52,785 INFO L273 TraceCheckUtils]: 47: Hoare triple {1491#false} havoc ~x~0;~x~0 := 0; {1491#false} is VALID [2018-11-23 11:51:52,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {1491#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {1491#false} is VALID [2018-11-23 11:51:52,786 INFO L256 TraceCheckUtils]: 49: Hoare triple {1491#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1491#false} is VALID [2018-11-23 11:51:52,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2018-11-23 11:51:52,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2018-11-23 11:51:52,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2018-11-23 11:51:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:51:52,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,792 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,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2018-11-23 11:51:53,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1490#true} is VALID [2018-11-23 11:51:53,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2018-11-23 11:51:53,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #175#return; {1490#true} is VALID [2018-11-23 11:51:53,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret24 := main(); {1490#true} is VALID [2018-11-23 11:51:53,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {1490#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {1490#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1490#true} is VALID [2018-11-23 11:51:53,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {1490#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1490#true} is VALID [2018-11-23 11:51:53,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1490#true} is VALID [2018-11-23 11:51:53,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {1490#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1490#true} is VALID [2018-11-23 11:51:53,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {1490#true} assume !(~a~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {1490#true} havoc ~i~0;~i~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 11:51:53,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {1490#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1490#true} is VALID [2018-11-23 11:51:53,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 11:51:53,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {1490#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1490#true} is VALID [2018-11-23 11:51:53,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 11:51:53,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {1490#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1490#true} is VALID [2018-11-23 11:51:53,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 11:51:53,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {1490#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1490#true} is VALID [2018-11-23 11:51:53,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 11:51:53,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 11:51:53,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {1490#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1490#true} is VALID [2018-11-23 11:51:53,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 11:51:53,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {1490#true} ~i~0 := 0; {1591#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,084 INFO L273 TraceCheckUtils]: 32: Hoare triple {1591#(<= 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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1591#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {1591#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1598#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {1598#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:53,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:53,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {1491#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; {1491#false} is VALID [2018-11-23 11:51:53,097 INFO L273 TraceCheckUtils]: 37: Hoare triple {1491#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1491#false} is VALID [2018-11-23 11:51:53,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:53,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1491#false} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {1491#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1491#false} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {1491#false} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {1491#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {1491#false} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {1491#false} havoc ~x~0;~x~0 := 0; {1491#false} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {1491#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {1491#false} is VALID [2018-11-23 11:51:53,100 INFO L256 TraceCheckUtils]: 49: Hoare triple {1491#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1491#false} is VALID [2018-11-23 11:51:53,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2018-11-23 11:51:53,100 INFO L273 TraceCheckUtils]: 51: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2018-11-23 11:51:53,100 INFO L273 TraceCheckUtils]: 52: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2018-11-23 11:51:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:51:53,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:53,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-23 11:51:53,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:53,337 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:51:53,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,338 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 7 states. [2018-11-23 11:51:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,085 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-11-23 11:51:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-23 11:51:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 11:51:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 11:51:54,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-23 11:51:54,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,316 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:51:54,316 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:51:54,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:51:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-23 11:51:54,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 78 states. [2018-11-23 11:51:54,427 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 78 states. [2018-11-23 11:51:54,427 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 78 states. [2018-11-23 11:51:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,431 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-23 11:51:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 11:51:54,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,432 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 88 states. [2018-11-23 11:51:54,432 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 88 states. [2018-11-23 11:51:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,435 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-23 11:51:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 11:51:54,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:51:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-23 11:51:54,440 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 53 [2018-11-23 11:51:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,440 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-23 11:51:54,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-23 11:51:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:51:54,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,442 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-23 11:51:54,442 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1331683396, now seen corresponding path program 3 times [2018-11-23 11:51:54,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 11:51:54,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 11:51:54,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 11:51:54,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #175#return; {2141#true} is VALID [2018-11-23 11:51:54,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret24 := main(); {2141#true} is VALID [2018-11-23 11:51:54,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2143#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2143#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2144#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {2144#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2144#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {2144#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {2145#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2145#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {2145#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2146#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {2146#(<= main_~a~0 3)} assume !(~a~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#false} havoc ~i~0;~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 11:51:54,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2142#false} is VALID [2018-11-23 11:51:54,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,735 INFO L273 TraceCheckUtils]: 20: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {2142#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2142#false} is VALID [2018-11-23 11:51:54,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {2142#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2142#false} is VALID [2018-11-23 11:51:54,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2142#false} is VALID [2018-11-23 11:51:54,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2142#false} is VALID [2018-11-23 11:51:54,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {2142#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2142#false} is VALID [2018-11-23 11:51:54,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2142#false} is VALID [2018-11-23 11:51:54,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2142#false} is VALID [2018-11-23 11:51:54,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,739 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2142#false} is VALID [2018-11-23 11:51:54,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2142#false} is VALID [2018-11-23 11:51:54,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2142#false} is VALID [2018-11-23 11:51:54,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {2142#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 51: Hoare triple {2142#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2142#false} is VALID [2018-11-23 11:51:54,741 INFO L273 TraceCheckUtils]: 52: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:54,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2142#false} is VALID [2018-11-23 11:51:54,742 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,742 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,742 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2142#false} is VALID [2018-11-23 11:51:54,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {2142#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2142#false} is VALID [2018-11-23 11:51:54,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2142#false} is VALID [2018-11-23 11:51:54,743 INFO L273 TraceCheckUtils]: 59: Hoare triple {2142#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2142#false} is VALID [2018-11-23 11:51:54,743 INFO L273 TraceCheckUtils]: 60: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,744 INFO L273 TraceCheckUtils]: 61: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,744 INFO L273 TraceCheckUtils]: 62: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2142#false} is VALID [2018-11-23 11:51:54,744 INFO L273 TraceCheckUtils]: 63: Hoare triple {2142#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2142#false} is VALID [2018-11-23 11:51:54,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2142#false} is VALID [2018-11-23 11:51:54,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {2142#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2142#false} is VALID [2018-11-23 11:51:54,745 INFO L273 TraceCheckUtils]: 66: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:54,745 INFO L273 TraceCheckUtils]: 67: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 11:51:54,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 11:51:54,745 INFO L256 TraceCheckUtils]: 69: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2142#false} is VALID [2018-11-23 11:51:54,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 11:51:54,746 INFO L273 TraceCheckUtils]: 71: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 11:51:54,746 INFO L273 TraceCheckUtils]: 72: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 11:51:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:51:54,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,752 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,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:54,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:54,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 11:51:55,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 11:51:55,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 11:51:55,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #175#return; {2141#true} is VALID [2018-11-23 11:51:55,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret24 := main(); {2141#true} is VALID [2018-11-23 11:51:55,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2141#true} is VALID [2018-11-23 11:51:55,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2141#true} is VALID [2018-11-23 11:51:55,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:51:55,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2141#true} is VALID [2018-11-23 11:51:55,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:51:55,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {2141#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2141#true} is VALID [2018-11-23 11:51:55,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 11:51:55,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {2141#true} assume !(~a~0 < 100000); {2141#true} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {2141#true} havoc ~i~0;~i~0 := 0; {2141#true} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2141#true} is VALID [2018-11-23 11:51:55,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {2141#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2141#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 11:51:55,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2141#true} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2141#true} is VALID [2018-11-23 11:51:55,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2141#true} is VALID [2018-11-23 11:51:55,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {2141#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2141#true} is VALID [2018-11-23 11:51:55,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 11:51:55,066 INFO L273 TraceCheckUtils]: 31: Hoare triple {2141#true} ~i~0 := 0; {2243#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {2243#(<= 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; {2243#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {2243#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2250#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {2250#(<= 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; {2250#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 35: Hoare triple {2250#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2257#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {2257#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2142#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2142#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2142#false} is VALID [2018-11-23 11:51:55,075 INFO L273 TraceCheckUtils]: 47: Hoare triple {2142#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2142#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 48: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 49: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:55,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {2142#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2142#false} is VALID [2018-11-23 11:51:55,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {2142#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; {2142#false} is VALID [2018-11-23 11:51:55,077 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2142#false} is VALID [2018-11-23 11:51:55,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2142#false} is VALID [2018-11-23 11:51:55,078 INFO L273 TraceCheckUtils]: 57: Hoare triple {2142#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2142#false} is VALID [2018-11-23 11:51:55,078 INFO L273 TraceCheckUtils]: 58: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2142#false} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {2142#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2142#false} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2142#false} is VALID [2018-11-23 11:51:55,079 INFO L273 TraceCheckUtils]: 63: Hoare triple {2142#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 64: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {2142#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 11:51:55,080 INFO L256 TraceCheckUtils]: 69: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2142#false} is VALID [2018-11-23 11:51:55,081 INFO L273 TraceCheckUtils]: 70: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 11:51:55,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 11:51:55,081 INFO L273 TraceCheckUtils]: 72: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 11:51:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 11:51:55,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:55,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-11-23 11:51:55,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:55,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:55,226 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 9 states. [2018-11-23 11:51:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,095 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2018-11-23 11:51:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:56,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-11-23 11:51:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2018-11-23 11:51:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2018-11-23 11:51:56,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 175 transitions. [2018-11-23 11:51:56,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,458 INFO L225 Difference]: With dead ends: 173 [2018-11-23 11:51:56,458 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 11:51:56,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 11:51:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-11-23 11:51:56,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 98 states. [2018-11-23 11:51:56,507 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 98 states. [2018-11-23 11:51:56,507 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 98 states. [2018-11-23 11:51:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,511 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 11:51:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-23 11:51:56,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,512 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 108 states. [2018-11-23 11:51:56,512 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 108 states. [2018-11-23 11:51:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,515 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 11:51:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-23 11:51:56,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:51:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-23 11:51:56,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 73 [2018-11-23 11:51:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,520 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-23 11:51:56,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-23 11:51:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:51:56,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,521 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-23 11:51:56,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1977892568, now seen corresponding path program 4 times [2018-11-23 11:51:56,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 11:51:56,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2981#true} is VALID [2018-11-23 11:51:56,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 11:51:56,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #175#return; {2981#true} is VALID [2018-11-23 11:51:56,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret24 := main(); {2981#true} is VALID [2018-11-23 11:51:56,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2983#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {2983#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2983#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {2983#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {2984#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {2985#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,848 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {2982#false} havoc ~i~0;~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:56,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:56,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:56,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:56,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 32: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 38: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,853 INFO L273 TraceCheckUtils]: 41: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 42: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 43: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,855 INFO L273 TraceCheckUtils]: 48: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,855 INFO L273 TraceCheckUtils]: 49: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:56,855 INFO L273 TraceCheckUtils]: 50: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:56,855 INFO L273 TraceCheckUtils]: 52: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 53: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 54: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 57: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 58: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:56,856 INFO L273 TraceCheckUtils]: 60: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:56,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:56,857 INFO L273 TraceCheckUtils]: 62: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,857 INFO L273 TraceCheckUtils]: 63: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,857 INFO L273 TraceCheckUtils]: 64: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,858 INFO L273 TraceCheckUtils]: 65: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:56,858 INFO L273 TraceCheckUtils]: 66: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,858 INFO L273 TraceCheckUtils]: 67: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:56,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:56,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 70: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 71: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 72: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 73: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 74: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:56,859 INFO L273 TraceCheckUtils]: 75: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:56,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:56,860 INFO L273 TraceCheckUtils]: 77: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:56,860 INFO L273 TraceCheckUtils]: 78: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,860 INFO L273 TraceCheckUtils]: 79: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,860 INFO L273 TraceCheckUtils]: 80: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:56,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:56,861 INFO L273 TraceCheckUtils]: 82: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:56,861 INFO L273 TraceCheckUtils]: 83: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:56,861 INFO L273 TraceCheckUtils]: 84: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:56,861 INFO L273 TraceCheckUtils]: 85: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:56,862 INFO L273 TraceCheckUtils]: 86: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:56,862 INFO L273 TraceCheckUtils]: 87: Hoare triple {2982#false} havoc ~x~0;~x~0 := 0; {2982#false} is VALID [2018-11-23 11:51:56,862 INFO L273 TraceCheckUtils]: 88: Hoare triple {2982#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2982#false} is VALID [2018-11-23 11:51:56,862 INFO L256 TraceCheckUtils]: 89: Hoare triple {2982#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2982#false} is VALID [2018-11-23 11:51:56,862 INFO L273 TraceCheckUtils]: 90: Hoare triple {2982#false} ~cond := #in~cond; {2982#false} is VALID [2018-11-23 11:51:56,863 INFO L273 TraceCheckUtils]: 91: Hoare triple {2982#false} assume 0 == ~cond; {2982#false} is VALID [2018-11-23 11:51:56,863 INFO L273 TraceCheckUtils]: 92: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 11:51:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:51:56,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,868 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,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:56,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:56,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 11:51:57,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2981#true} is VALID [2018-11-23 11:51:57,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 11:51:57,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #175#return; {2981#true} is VALID [2018-11-23 11:51:57,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret24 := main(); {2981#true} is VALID [2018-11-23 11:51:57,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3006#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:57,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {3006#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3006#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:57,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {3006#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {2984#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {2985#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {2982#false} havoc ~i~0;~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:57,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {2982#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2982#false} is VALID [2018-11-23 11:51:57,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {2982#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 41: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 43: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 44: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,318 INFO L273 TraceCheckUtils]: 45: Hoare triple {2982#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 46: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 47: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 48: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {2982#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 54: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 56: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 59: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 60: Hoare triple {2982#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2982#false} is VALID [2018-11-23 11:51:57,320 INFO L273 TraceCheckUtils]: 61: Hoare triple {2982#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 63: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 65: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 68: Hoare triple {2982#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; {2982#false} is VALID [2018-11-23 11:51:57,321 INFO L273 TraceCheckUtils]: 69: Hoare triple {2982#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 70: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 71: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 72: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 73: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 74: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 75: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:57,322 INFO L273 TraceCheckUtils]: 76: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2982#false} is VALID [2018-11-23 11:51:57,323 INFO L273 TraceCheckUtils]: 77: Hoare triple {2982#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2982#false} is VALID [2018-11-23 11:51:57,323 INFO L273 TraceCheckUtils]: 78: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,323 INFO L273 TraceCheckUtils]: 79: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,323 INFO L273 TraceCheckUtils]: 80: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:57,323 INFO L273 TraceCheckUtils]: 81: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 82: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 83: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 84: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 85: Hoare triple {2982#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 86: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 11:51:57,324 INFO L273 TraceCheckUtils]: 87: Hoare triple {2982#false} havoc ~x~0;~x~0 := 0; {2982#false} is VALID [2018-11-23 11:51:57,325 INFO L273 TraceCheckUtils]: 88: Hoare triple {2982#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2982#false} is VALID [2018-11-23 11:51:57,325 INFO L256 TraceCheckUtils]: 89: Hoare triple {2982#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2982#false} is VALID [2018-11-23 11:51:57,325 INFO L273 TraceCheckUtils]: 90: Hoare triple {2982#false} ~cond := #in~cond; {2982#false} is VALID [2018-11-23 11:51:57,325 INFO L273 TraceCheckUtils]: 91: Hoare triple {2982#false} assume 0 == ~cond; {2982#false} is VALID [2018-11-23 11:51:57,325 INFO L273 TraceCheckUtils]: 92: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 11:51:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:51:57,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:57,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-23 11:51:57,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:57,507 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:51:57,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:57,509 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-11-23 11:51:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,239 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-11-23 11:51:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:58,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-23 11:51:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 11:51:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 11:51:58,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 11:51:58,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,375 INFO L225 Difference]: With dead ends: 184 [2018-11-23 11:51:58,375 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:51:58,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:51:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 11:51:58,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 11:51:58,421 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 11:51:58,421 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 11:51:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,425 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-23 11:51:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-23 11:51:58,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,426 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 11:51:58,426 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 11:51:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,428 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-23 11:51:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-23 11:51:58,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:51:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-23 11:51:58,432 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 93 [2018-11-23 11:51:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,432 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-23 11:51:58,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-23 11:51:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:51:58,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,433 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-23 11:51:58,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -102109498, now seen corresponding path program 5 times [2018-11-23 11:51:58,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {3890#true} call ULTIMATE.init(); {3890#true} is VALID [2018-11-23 11:51:58,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {3890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3890#true} is VALID [2018-11-23 11:51:58,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {3890#true} assume true; {3890#true} is VALID [2018-11-23 11:51:58,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3890#true} {3890#true} #175#return; {3890#true} is VALID [2018-11-23 11:51:58,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {3890#true} call #t~ret24 := main(); {3890#true} is VALID [2018-11-23 11:51:58,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {3890#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3892#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {3892#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3892#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {3892#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {3893#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {3893#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {3894#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {3894#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {3895#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {3895#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {3896#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {3896#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3897#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {3891#false} havoc ~i~0;~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:51:58,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:51:58,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:51:58,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:51:58,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:51:58,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:51:58,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,587 INFO L273 TraceCheckUtils]: 34: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:51:58,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 39: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 40: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 41: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 42: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 43: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:51:58,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 45: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 46: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 49: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 51: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:51:58,589 INFO L273 TraceCheckUtils]: 52: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 53: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 54: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 55: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 56: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 57: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,590 INFO L273 TraceCheckUtils]: 58: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:51:58,591 INFO L273 TraceCheckUtils]: 59: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:51:58,591 INFO L273 TraceCheckUtils]: 60: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:51:58,591 INFO L273 TraceCheckUtils]: 61: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:51:58,591 INFO L273 TraceCheckUtils]: 62: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:51:58,591 INFO L273 TraceCheckUtils]: 63: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 64: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 65: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 66: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 67: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 68: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,592 INFO L273 TraceCheckUtils]: 69: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 70: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 71: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 72: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 73: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 74: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:51:58,593 INFO L273 TraceCheckUtils]: 75: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:51:58,594 INFO L273 TraceCheckUtils]: 76: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:51:58,594 INFO L273 TraceCheckUtils]: 77: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:51:58,594 INFO L273 TraceCheckUtils]: 78: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:51:58,594 INFO L273 TraceCheckUtils]: 79: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:51:58,594 INFO L273 TraceCheckUtils]: 80: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 81: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 82: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 83: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 84: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 85: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:51:58,595 INFO L273 TraceCheckUtils]: 86: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L273 TraceCheckUtils]: 87: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L273 TraceCheckUtils]: 88: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L273 TraceCheckUtils]: 89: Hoare triple {3891#false} havoc ~x~0;~x~0 := 0; {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L273 TraceCheckUtils]: 90: Hoare triple {3891#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L256 TraceCheckUtils]: 91: Hoare triple {3891#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {3891#false} is VALID [2018-11-23 11:51:58,596 INFO L273 TraceCheckUtils]: 92: Hoare triple {3891#false} ~cond := #in~cond; {3891#false} is VALID [2018-11-23 11:51:58,597 INFO L273 TraceCheckUtils]: 93: Hoare triple {3891#false} assume 0 == ~cond; {3891#false} is VALID [2018-11-23 11:51:58,597 INFO L273 TraceCheckUtils]: 94: Hoare triple {3891#false} assume !false; {3891#false} is VALID [2018-11-23 11:51:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:51:58,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,602 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:58,617 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:22,863 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:52:22,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:23,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {3890#true} call ULTIMATE.init(); {3890#true} is VALID [2018-11-23 11:52:23,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {3890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3890#true} is VALID [2018-11-23 11:52:23,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {3890#true} assume true; {3890#true} is VALID [2018-11-23 11:52:23,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3890#true} {3890#true} #175#return; {3890#true} is VALID [2018-11-23 11:52:23,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {3890#true} call #t~ret24 := main(); {3890#true} is VALID [2018-11-23 11:52:23,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {3890#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3916#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:23,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {3916#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3916#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:23,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {3916#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:23,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {3893#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:23,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {3893#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:23,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {3894#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:23,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {3894#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:23,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {3895#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:23,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {3895#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:23,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {3896#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:23,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {3896#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3897#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:23,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {3891#false} havoc ~i~0;~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:52:23,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:52:23,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {3891#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3891#false} is VALID [2018-11-23 11:52:23,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:52:23,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,049 INFO L273 TraceCheckUtils]: 29: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:52:23,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {3891#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3891#false} is VALID [2018-11-23 11:52:23,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,049 INFO L273 TraceCheckUtils]: 33: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:52:23,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:52:23,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {3891#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 42: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 43: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 45: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:52:23,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 47: Hoare triple {3891#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 48: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 49: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 50: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 51: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 52: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,052 INFO L273 TraceCheckUtils]: 53: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {3891#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 56: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 57: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 58: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:52:23,053 INFO L273 TraceCheckUtils]: 59: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:52:23,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:52:23,054 INFO L273 TraceCheckUtils]: 61: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:52:23,054 INFO L273 TraceCheckUtils]: 62: Hoare triple {3891#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3891#false} is VALID [2018-11-23 11:52:23,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {3891#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3891#false} is VALID [2018-11-23 11:52:23,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 67: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 68: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 69: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:52:23,055 INFO L273 TraceCheckUtils]: 70: Hoare triple {3891#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; {3891#false} is VALID [2018-11-23 11:52:23,056 INFO L273 TraceCheckUtils]: 71: Hoare triple {3891#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3891#false} is VALID [2018-11-23 11:52:23,056 INFO L273 TraceCheckUtils]: 72: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,056 INFO L273 TraceCheckUtils]: 73: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,056 INFO L273 TraceCheckUtils]: 74: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:52:23,056 INFO L273 TraceCheckUtils]: 75: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 76: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 77: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 78: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {3891#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 80: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,057 INFO L273 TraceCheckUtils]: 81: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 82: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 83: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 84: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 85: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 86: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {3891#false} is VALID [2018-11-23 11:52:23,058 INFO L273 TraceCheckUtils]: 87: Hoare triple {3891#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {3891#false} is VALID [2018-11-23 11:52:23,059 INFO L273 TraceCheckUtils]: 88: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 11:52:23,059 INFO L273 TraceCheckUtils]: 89: Hoare triple {3891#false} havoc ~x~0;~x~0 := 0; {3891#false} is VALID [2018-11-23 11:52:23,059 INFO L273 TraceCheckUtils]: 90: Hoare triple {3891#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {3891#false} is VALID [2018-11-23 11:52:23,059 INFO L256 TraceCheckUtils]: 91: Hoare triple {3891#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {3891#false} is VALID [2018-11-23 11:52:23,059 INFO L273 TraceCheckUtils]: 92: Hoare triple {3891#false} ~cond := #in~cond; {3891#false} is VALID [2018-11-23 11:52:23,060 INFO L273 TraceCheckUtils]: 93: Hoare triple {3891#false} assume 0 == ~cond; {3891#false} is VALID [2018-11-23 11:52:23,060 INFO L273 TraceCheckUtils]: 94: Hoare triple {3891#false} assume !false; {3891#false} is VALID [2018-11-23 11:52:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:23,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:23,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:52:23,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-23 11:52:23,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:23,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:52:23,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:23,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:52:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:52:23,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:52:23,218 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 9 states. [2018-11-23 11:52:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:23,754 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-11-23 11:52:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:52:23,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-23 11:52:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:52:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2018-11-23 11:52:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:52:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2018-11-23 11:52:23,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2018-11-23 11:52:23,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:23,870 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:52:23,870 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 11:52:23,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:52:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 11:52:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-23 11:52:24,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:24,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 102 states. [2018-11-23 11:52:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 102 states. [2018-11-23 11:52:24,472 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 102 states. [2018-11-23 11:52:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,476 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-23 11:52:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-11-23 11:52:24,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,477 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 103 states. [2018-11-23 11:52:24,477 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 103 states. [2018-11-23 11:52:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,481 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-23 11:52:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-11-23 11:52:24,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:24,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:52:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-23 11:52:24,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 95 [2018-11-23 11:52:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:24,488 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-23 11:52:24,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:52:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-23 11:52:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:52:24,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:24,489 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-23 11:52:24,489 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:24,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1360843548, now seen corresponding path program 6 times [2018-11-23 11:52:24,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:24,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4816#true} is VALID [2018-11-23 11:52:24,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {4816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4816#true} is VALID [2018-11-23 11:52:24,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-23 11:52:24,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #175#return; {4816#true} is VALID [2018-11-23 11:52:24,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret24 := main(); {4816#true} is VALID [2018-11-23 11:52:24,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {4816#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4818#(= main_~a~0 0)} is VALID [2018-11-23 11:52:24,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {4818#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4818#(= main_~a~0 0)} is VALID [2018-11-23 11:52:24,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {4818#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4819#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:24,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {4819#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4819#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:24,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {4819#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4820#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:24,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {4820#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4820#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:24,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {4820#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4821#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:24,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {4821#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4821#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:24,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {4821#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4822#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:24,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {4822#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4822#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:24,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {4822#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4823#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:25,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {4823#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4823#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:25,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {4823#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4824#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:25,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {4824#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {4817#false} havoc ~i~0;~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {4817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4817#false} is VALID [2018-11-23 11:52:25,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {4817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4817#false} is VALID [2018-11-23 11:52:25,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,003 INFO L273 TraceCheckUtils]: 25: Hoare triple {4817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4817#false} is VALID [2018-11-23 11:52:25,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {4817#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {4817#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {4817#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,004 INFO L273 TraceCheckUtils]: 37: Hoare triple {4817#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 39: Hoare triple {4817#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {4817#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 42: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:25,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:25,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 55: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 61: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 62: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:25,007 INFO L273 TraceCheckUtils]: 63: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 65: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 66: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 67: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 68: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,008 INFO L273 TraceCheckUtils]: 71: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 72: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 73: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 74: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 75: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 76: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 77: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 78: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 79: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:25,009 INFO L273 TraceCheckUtils]: 80: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 81: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 82: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 83: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 84: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 85: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 86: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 87: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:25,010 INFO L273 TraceCheckUtils]: 88: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L273 TraceCheckUtils]: 89: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L273 TraceCheckUtils]: 90: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L273 TraceCheckUtils]: 91: Hoare triple {4817#false} havoc ~x~0;~x~0 := 0; {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L273 TraceCheckUtils]: 92: Hoare triple {4817#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L256 TraceCheckUtils]: 93: Hoare triple {4817#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {4817#false} is VALID [2018-11-23 11:52:25,011 INFO L273 TraceCheckUtils]: 94: Hoare triple {4817#false} ~cond := #in~cond; {4817#false} is VALID [2018-11-23 11:52:25,012 INFO L273 TraceCheckUtils]: 95: Hoare triple {4817#false} assume 0 == ~cond; {4817#false} is VALID [2018-11-23 11:52:25,012 INFO L273 TraceCheckUtils]: 96: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2018-11-23 11:52:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:25,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:25,017 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:25,034 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:26,123 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:26,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:26,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:26,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4816#true} is VALID [2018-11-23 11:52:26,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {4816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4816#true} is VALID [2018-11-23 11:52:26,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2018-11-23 11:52:26,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #175#return; {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret24 := main(); {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {4816#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {4816#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4816#true} is VALID [2018-11-23 11:52:26,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {4816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {4816#true} assume !(~a~0 < 100000); {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {4816#true} havoc ~i~0;~i~0 := 0; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {4816#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {4816#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {4816#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4816#true} is VALID [2018-11-23 11:52:26,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {4816#true} assume !(~i~0 < 100000); {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {4816#true} ~i~0 := 0; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {4816#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {4816#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {4816#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; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {4816#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4816#true} is VALID [2018-11-23 11:52:26,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {4816#true} assume !(~i~0 < 100000); {4816#true} is VALID [2018-11-23 11:52:26,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {4816#true} ~i~0 := 0; {4933#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:26,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {4933#(<= main_~i~0 0)} 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; {4933#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {4933#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4940#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {4940#(<= main_~i~0 1)} 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; {4940#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:26,345 INFO L273 TraceCheckUtils]: 39: Hoare triple {4940#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4947#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {4947#(<= main_~i~0 2)} 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; {4947#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:26,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {4947#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4954#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {4954#(<= main_~i~0 3)} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {4817#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4817#false} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 50: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:26,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:26,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {4817#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4817#false} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 61: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 64: Hoare triple {4817#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 65: Hoare triple {4817#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4817#false} is VALID [2018-11-23 11:52:26,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 67: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 69: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 70: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 71: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:26,352 INFO L273 TraceCheckUtils]: 72: Hoare triple {4817#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; {4817#false} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {4817#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4817#false} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 74: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 75: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,353 INFO L273 TraceCheckUtils]: 76: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 77: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4817#false} is VALID [2018-11-23 11:52:26,354 INFO L273 TraceCheckUtils]: 81: Hoare triple {4817#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4817#false} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {4817#false} ~i~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:26,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {4817#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {4817#false} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 89: Hoare triple {4817#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {4817#false} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 90: Hoare triple {4817#false} assume !(~i~0 < 100000); {4817#false} is VALID [2018-11-23 11:52:26,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {4817#false} havoc ~x~0;~x~0 := 0; {4817#false} is VALID [2018-11-23 11:52:26,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {4817#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {4817#false} is VALID [2018-11-23 11:52:26,357 INFO L256 TraceCheckUtils]: 93: Hoare triple {4817#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {4817#false} is VALID [2018-11-23 11:52:26,357 INFO L273 TraceCheckUtils]: 94: Hoare triple {4817#false} ~cond := #in~cond; {4817#false} is VALID [2018-11-23 11:52:26,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {4817#false} assume 0 == ~cond; {4817#false} is VALID [2018-11-23 11:52:26,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2018-11-23 11:52:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 11:52:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:26,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:52:26,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-11-23 11:52:26,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:26,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:26,474 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:26,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:26,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:26,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:26,476 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 13 states. [2018-11-23 11:52:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,501 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2018-11-23 11:52:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:27,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-11-23 11:52:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2018-11-23 11:52:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2018-11-23 11:52:27,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 199 transitions. [2018-11-23 11:52:27,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:27,702 INFO L225 Difference]: With dead ends: 215 [2018-11-23 11:52:27,702 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 11:52:27,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 11:52:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-11-23 11:52:27,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:27,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 122 states. [2018-11-23 11:52:27,771 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 122 states. [2018-11-23 11:52:27,771 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 122 states. [2018-11-23 11:52:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,775 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-11-23 11:52:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-11-23 11:52:27,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:27,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:27,776 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 132 states. [2018-11-23 11:52:27,776 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 132 states. [2018-11-23 11:52:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:27,780 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-11-23 11:52:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-11-23 11:52:27,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:27,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:27,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:27,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:52:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-11-23 11:52:27,785 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 97 [2018-11-23 11:52:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:27,785 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-11-23 11:52:27,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-11-23 11:52:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 11:52:27,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:27,787 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-23 11:52:27,787 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:27,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2085135792, now seen corresponding path program 7 times [2018-11-23 11:52:27,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:27,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:27,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:27,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {5879#true} call ULTIMATE.init(); {5879#true} is VALID [2018-11-23 11:52:28,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {5879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5879#true} is VALID [2018-11-23 11:52:28,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {5879#true} assume true; {5879#true} is VALID [2018-11-23 11:52:28,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5879#true} {5879#true} #175#return; {5879#true} is VALID [2018-11-23 11:52:28,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {5879#true} call #t~ret24 := main(); {5879#true} is VALID [2018-11-23 11:52:28,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {5879#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5881#(= main_~a~0 0)} is VALID [2018-11-23 11:52:28,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {5881#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5881#(= main_~a~0 0)} is VALID [2018-11-23 11:52:28,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {5881#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5882#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:28,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {5882#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5882#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:28,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {5882#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5883#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:28,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {5883#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5883#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:28,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {5883#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5884#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:28,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {5884#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5884#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:28,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {5884#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5885#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:28,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {5885#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5885#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:28,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {5885#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5886#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:28,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {5886#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5886#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:28,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5887#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:28,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {5887#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5887#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:28,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {5887#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5888#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {5880#false} havoc ~i~0;~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 49: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 50: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 51: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 54: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 55: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 60: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,582 INFO L273 TraceCheckUtils]: 61: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 64: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 68: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,583 INFO L273 TraceCheckUtils]: 69: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 71: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 73: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 74: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 75: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 77: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,584 INFO L273 TraceCheckUtils]: 78: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 83: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 84: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 85: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,585 INFO L273 TraceCheckUtils]: 86: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 87: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 88: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 89: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 90: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 91: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 92: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 93: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 94: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,586 INFO L273 TraceCheckUtils]: 95: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 96: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 97: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 98: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 99: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 101: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 102: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 103: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,587 INFO L273 TraceCheckUtils]: 104: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 106: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 107: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 108: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 109: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 110: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 111: Hoare triple {5880#false} havoc ~x~0;~x~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,588 INFO L273 TraceCheckUtils]: 112: Hoare triple {5880#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {5880#false} is VALID [2018-11-23 11:52:28,589 INFO L256 TraceCheckUtils]: 113: Hoare triple {5880#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {5880#false} is VALID [2018-11-23 11:52:28,589 INFO L273 TraceCheckUtils]: 114: Hoare triple {5880#false} ~cond := #in~cond; {5880#false} is VALID [2018-11-23 11:52:28,589 INFO L273 TraceCheckUtils]: 115: Hoare triple {5880#false} assume 0 == ~cond; {5880#false} is VALID [2018-11-23 11:52:28,589 INFO L273 TraceCheckUtils]: 116: Hoare triple {5880#false} assume !false; {5880#false} is VALID [2018-11-23 11:52:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:28,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:28,594 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:28,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:28,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:28,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {5879#true} call ULTIMATE.init(); {5879#true} is VALID [2018-11-23 11:52:28,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {5879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5879#true} is VALID [2018-11-23 11:52:28,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {5879#true} assume true; {5879#true} is VALID [2018-11-23 11:52:28,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5879#true} {5879#true} #175#return; {5879#true} is VALID [2018-11-23 11:52:28,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {5879#true} call #t~ret24 := main(); {5879#true} is VALID [2018-11-23 11:52:28,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {5879#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5907#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:28,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {5907#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5907#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:28,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {5907#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5882#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:28,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {5882#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5882#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:28,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {5882#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5883#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:28,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {5883#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5883#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:28,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {5883#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5884#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:28,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {5884#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5884#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:28,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {5884#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5885#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:28,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {5885#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5885#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:28,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {5885#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5886#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:28,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {5886#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5886#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:28,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5887#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:28,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {5887#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5887#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:28,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {5887#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5888#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {5880#false} havoc ~i~0;~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {5880#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5880#false} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,939 INFO L273 TraceCheckUtils]: 34: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 35: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 36: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {5880#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 40: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 44: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,941 INFO L273 TraceCheckUtils]: 45: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 46: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {5880#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 51: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 54: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 55: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 56: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 57: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 58: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {5880#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5880#false} is VALID [2018-11-23 11:52:28,943 INFO L273 TraceCheckUtils]: 60: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 62: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 63: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 64: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {5880#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 72: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 73: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 74: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 75: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 76: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,945 INFO L273 TraceCheckUtils]: 77: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 78: Hoare triple {5880#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 79: Hoare triple {5880#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 80: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 81: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,946 INFO L273 TraceCheckUtils]: 86: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 87: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 88: Hoare triple {5880#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; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 89: Hoare triple {5880#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 90: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 91: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 92: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 93: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,947 INFO L273 TraceCheckUtils]: 94: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 95: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 96: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 97: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 98: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 99: Hoare triple {5880#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 100: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 101: Hoare triple {5880#false} ~i~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 102: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,948 INFO L273 TraceCheckUtils]: 103: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 105: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 106: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 107: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 108: Hoare triple {5880#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 109: Hoare triple {5880#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 110: Hoare triple {5880#false} assume !(~i~0 < 100000); {5880#false} is VALID [2018-11-23 11:52:28,949 INFO L273 TraceCheckUtils]: 111: Hoare triple {5880#false} havoc ~x~0;~x~0 := 0; {5880#false} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 112: Hoare triple {5880#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {5880#false} is VALID [2018-11-23 11:52:28,950 INFO L256 TraceCheckUtils]: 113: Hoare triple {5880#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {5880#false} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 114: Hoare triple {5880#false} ~cond := #in~cond; {5880#false} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 115: Hoare triple {5880#false} assume 0 == ~cond; {5880#false} is VALID [2018-11-23 11:52:28,950 INFO L273 TraceCheckUtils]: 116: Hoare triple {5880#false} assume !false; {5880#false} is VALID [2018-11-23 11:52:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:28,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:28,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:52:28,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2018-11-23 11:52:28,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:28,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:52:29,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:29,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:52:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:52:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:29,036 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 11 states. [2018-11-23 11:52:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,279 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-11-23 11:52:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:29,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2018-11-23 11:52:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-23 11:52:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-23 11:52:29,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 120 transitions. [2018-11-23 11:52:29,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:29,417 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:52:29,417 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:52:29,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:52:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-11-23 11:52:29,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:29,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 124 states. [2018-11-23 11:52:29,540 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 124 states. [2018-11-23 11:52:29,540 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 124 states. [2018-11-23 11:52:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,542 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-11-23 11:52:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-11-23 11:52:29,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,544 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 125 states. [2018-11-23 11:52:29,544 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 125 states. [2018-11-23 11:52:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,546 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-11-23 11:52:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-11-23 11:52:29,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:29,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 11:52:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-11-23 11:52:29,549 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 117 [2018-11-23 11:52:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:29,550 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-11-23 11:52:29,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-11-23 11:52:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:52:29,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:29,551 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-23 11:52:29,551 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:29,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash -52556306, now seen corresponding path program 8 times [2018-11-23 11:52:29,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:29,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {7010#true} call ULTIMATE.init(); {7010#true} is VALID [2018-11-23 11:52:29,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {7010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7010#true} is VALID [2018-11-23 11:52:29,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2018-11-23 11:52:29,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7010#true} #175#return; {7010#true} is VALID [2018-11-23 11:52:29,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {7010#true} call #t~ret24 := main(); {7010#true} is VALID [2018-11-23 11:52:29,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {7010#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7012#(= main_~a~0 0)} is VALID [2018-11-23 11:52:29,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {7012#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7012#(= main_~a~0 0)} is VALID [2018-11-23 11:52:29,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {7012#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7013#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:29,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {7013#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7013#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:29,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {7013#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7014#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:29,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {7014#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7014#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:29,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {7014#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7015#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:29,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {7015#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7015#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:29,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {7015#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7016#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:29,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {7016#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7016#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:29,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {7016#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7017#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:29,778 INFO L273 TraceCheckUtils]: 16: Hoare triple {7017#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7017#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:29,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {7017#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7018#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:29,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {7018#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7018#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:29,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {7018#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7019#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:29,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {7019#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7019#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:29,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {7019#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7020#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:29,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {7020#(<= main_~a~0 8)} assume !(~a~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {7011#false} havoc ~i~0;~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:29,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:29,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,784 INFO L273 TraceCheckUtils]: 35: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:29,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:29,785 INFO L273 TraceCheckUtils]: 38: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:29,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:29,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,786 INFO L273 TraceCheckUtils]: 43: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 50: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 51: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,787 INFO L273 TraceCheckUtils]: 54: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 56: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 57: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 58: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 59: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 60: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 61: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:29,788 INFO L273 TraceCheckUtils]: 62: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 63: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 64: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 65: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 66: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 68: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 69: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 70: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,789 INFO L273 TraceCheckUtils]: 71: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 72: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 73: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 74: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 75: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 76: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 77: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 78: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:29,790 INFO L273 TraceCheckUtils]: 79: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 82: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 83: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 84: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 85: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 86: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 87: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:29,791 INFO L273 TraceCheckUtils]: 88: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 89: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 90: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 91: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 92: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 93: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,792 INFO L273 TraceCheckUtils]: 94: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:29,793 INFO L273 TraceCheckUtils]: 95: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:29,793 INFO L273 TraceCheckUtils]: 96: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:29,793 INFO L273 TraceCheckUtils]: 97: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:29,793 INFO L273 TraceCheckUtils]: 98: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:29,793 INFO L273 TraceCheckUtils]: 99: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 100: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 101: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 102: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 103: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 104: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:29,794 INFO L273 TraceCheckUtils]: 105: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 106: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 107: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 108: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 109: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 110: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:29,795 INFO L273 TraceCheckUtils]: 111: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L273 TraceCheckUtils]: 112: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L273 TraceCheckUtils]: 113: Hoare triple {7011#false} havoc ~x~0;~x~0 := 0; {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L273 TraceCheckUtils]: 114: Hoare triple {7011#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L256 TraceCheckUtils]: 115: Hoare triple {7011#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L273 TraceCheckUtils]: 116: Hoare triple {7011#false} ~cond := #in~cond; {7011#false} is VALID [2018-11-23 11:52:29,796 INFO L273 TraceCheckUtils]: 117: Hoare triple {7011#false} assume 0 == ~cond; {7011#false} is VALID [2018-11-23 11:52:29,797 INFO L273 TraceCheckUtils]: 118: Hoare triple {7011#false} assume !false; {7011#false} is VALID [2018-11-23 11:52:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:29,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:29,804 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:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:29,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:29,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:30,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {7010#true} call ULTIMATE.init(); {7010#true} is VALID [2018-11-23 11:52:30,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {7010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7010#true} is VALID [2018-11-23 11:52:30,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2018-11-23 11:52:30,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7010#true} #175#return; {7010#true} is VALID [2018-11-23 11:52:30,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {7010#true} call #t~ret24 := main(); {7010#true} is VALID [2018-11-23 11:52:30,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {7010#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7039#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:30,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {7039#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7039#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:30,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {7039#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7013#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:30,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {7013#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7013#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:30,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {7013#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7014#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:30,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {7014#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7014#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:30,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {7014#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7015#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:30,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {7015#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7015#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:30,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {7015#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7016#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:30,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {7016#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7016#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:30,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {7016#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7017#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:30,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {7017#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7017#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:30,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {7017#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7018#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:30,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {7018#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7018#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:30,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {7018#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7019#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:30,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {7019#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7019#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:30,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {7019#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7020#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:30,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {7020#(<= main_~a~0 8)} assume !(~a~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {7011#false} havoc ~i~0;~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:30,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:30,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:30,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {7011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7011#false} is VALID [2018-11-23 11:52:30,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 35: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:30,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {7011#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {7011#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:30,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 57: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {7011#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 66: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 70: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {7011#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 76: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 77: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 78: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 80: Hoare triple {7011#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7011#false} is VALID [2018-11-23 11:52:30,074 INFO L273 TraceCheckUtils]: 81: Hoare triple {7011#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 83: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 86: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 87: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 88: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 89: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:30,075 INFO L273 TraceCheckUtils]: 90: Hoare triple {7011#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; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 91: Hoare triple {7011#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 92: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 93: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 97: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:30,076 INFO L273 TraceCheckUtils]: 98: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 99: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 100: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 101: Hoare triple {7011#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 102: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 103: Hoare triple {7011#false} ~i~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 104: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 105: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 106: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:30,077 INFO L273 TraceCheckUtils]: 107: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 108: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 109: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 110: Hoare triple {7011#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 111: Hoare triple {7011#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 112: Hoare triple {7011#false} assume !(~i~0 < 100000); {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 113: Hoare triple {7011#false} havoc ~x~0;~x~0 := 0; {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L273 TraceCheckUtils]: 114: Hoare triple {7011#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {7011#false} is VALID [2018-11-23 11:52:30,078 INFO L256 TraceCheckUtils]: 115: Hoare triple {7011#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {7011#false} is VALID [2018-11-23 11:52:30,079 INFO L273 TraceCheckUtils]: 116: Hoare triple {7011#false} ~cond := #in~cond; {7011#false} is VALID [2018-11-23 11:52:30,079 INFO L273 TraceCheckUtils]: 117: Hoare triple {7011#false} assume 0 == ~cond; {7011#false} is VALID [2018-11-23 11:52:30,079 INFO L273 TraceCheckUtils]: 118: Hoare triple {7011#false} assume !false; {7011#false} is VALID [2018-11-23 11:52:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:30,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:30,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 11:52:30,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:30,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:30,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:30,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:30,168 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 12 states. [2018-11-23 11:52:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,693 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2018-11-23 11:52:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:31,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 11:52:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 11:52:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 11:52:31,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 122 transitions. [2018-11-23 11:52:31,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:31,866 INFO L225 Difference]: With dead ends: 228 [2018-11-23 11:52:31,866 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:52:31,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:52:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-23 11:52:32,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:32,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 126 states. [2018-11-23 11:52:32,166 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 126 states. [2018-11-23 11:52:32,166 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 126 states. [2018-11-23 11:52:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:32,169 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-11-23 11:52:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-11-23 11:52:32,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:32,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:32,170 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 127 states. [2018-11-23 11:52:32,170 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 127 states. [2018-11-23 11:52:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:32,173 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-11-23 11:52:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-11-23 11:52:32,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:32,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:32,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:32,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:52:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-23 11:52:32,176 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 119 [2018-11-23 11:52:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:32,176 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-23 11:52:32,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-23 11:52:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:52:32,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:32,178 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-23 11:52:32,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash -953789940, now seen corresponding path program 9 times [2018-11-23 11:52:32,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:32,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:33,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {8158#true} call ULTIMATE.init(); {8158#true} is VALID [2018-11-23 11:52:33,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {8158#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8158#true} is VALID [2018-11-23 11:52:33,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {8158#true} assume true; {8158#true} is VALID [2018-11-23 11:52:33,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8158#true} {8158#true} #175#return; {8158#true} is VALID [2018-11-23 11:52:33,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {8158#true} call #t~ret24 := main(); {8158#true} is VALID [2018-11-23 11:52:33,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {8158#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8160#(= main_~a~0 0)} is VALID [2018-11-23 11:52:33,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {8160#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8160#(= main_~a~0 0)} is VALID [2018-11-23 11:52:33,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {8160#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8161#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:33,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {8161#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8161#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:33,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {8161#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8162#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:33,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {8162#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8162#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:33,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {8162#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8163#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:33,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {8163#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8163#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:33,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {8163#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8164#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:33,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {8164#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8164#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:33,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {8164#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8165#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:33,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {8165#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8165#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:33,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {8165#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8166#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:33,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {8166#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8166#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:33,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {8166#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8167#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:33,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {8167#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8167#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:33,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {8167#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8168#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:33,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {8168#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8168#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:33,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {8168#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8169#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:33,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {8169#(<= main_~a~0 9)} assume !(~a~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {8159#false} havoc ~i~0;~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {8159#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {8159#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {8159#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8159#false} is VALID [2018-11-23 11:52:33,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {8159#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8159#false} is VALID [2018-11-23 11:52:33,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {8159#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8159#false} is VALID [2018-11-23 11:52:33,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {8159#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8159#false} is VALID [2018-11-23 11:52:33,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {8159#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8159#false} is VALID [2018-11-23 11:52:33,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {8159#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8159#false} is VALID [2018-11-23 11:52:33,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {8159#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 49: Hoare triple {8159#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {8159#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {8159#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {8159#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {8159#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {8159#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {8159#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8159#false} is VALID [2018-11-23 11:52:33,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 65: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 66: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {8159#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {8159#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 70: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 71: Hoare triple {8159#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 72: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {8159#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 76: Hoare triple {8159#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 77: Hoare triple {8159#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 78: Hoare triple {8159#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 79: Hoare triple {8159#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 80: Hoare triple {8159#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8159#false} is VALID [2018-11-23 11:52:33,139 INFO L273 TraceCheckUtils]: 81: Hoare triple {8159#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 82: Hoare triple {8159#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 83: Hoare triple {8159#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 84: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 85: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 86: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 87: Hoare triple {8159#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 88: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 89: Hoare triple {8159#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8159#false} is VALID [2018-11-23 11:52:33,140 INFO L273 TraceCheckUtils]: 90: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 91: Hoare triple {8159#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 92: Hoare triple {8159#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; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 93: Hoare triple {8159#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 94: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 95: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 96: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 97: Hoare triple {8159#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8159#false} is VALID [2018-11-23 11:52:33,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 99: Hoare triple {8159#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 100: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 101: Hoare triple {8159#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 102: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 103: Hoare triple {8159#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 104: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 105: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 106: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:33,142 INFO L273 TraceCheckUtils]: 107: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 108: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 109: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 110: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 111: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 112: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 113: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 114: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 115: Hoare triple {8159#false} havoc ~x~0;~x~0 := 0; {8159#false} is VALID [2018-11-23 11:52:33,143 INFO L273 TraceCheckUtils]: 116: Hoare triple {8159#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {8159#false} is VALID [2018-11-23 11:52:33,144 INFO L256 TraceCheckUtils]: 117: Hoare triple {8159#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {8159#false} is VALID [2018-11-23 11:52:33,144 INFO L273 TraceCheckUtils]: 118: Hoare triple {8159#false} ~cond := #in~cond; {8159#false} is VALID [2018-11-23 11:52:33,144 INFO L273 TraceCheckUtils]: 119: Hoare triple {8159#false} assume 0 == ~cond; {8159#false} is VALID [2018-11-23 11:52:33,144 INFO L273 TraceCheckUtils]: 120: Hoare triple {8159#false} assume !false; {8159#false} is VALID [2018-11-23 11:52:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:33,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:33,154 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:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:34,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:52:34,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:34,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:34,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {8158#true} call ULTIMATE.init(); {8158#true} is VALID [2018-11-23 11:52:34,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {8158#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8158#true} is VALID [2018-11-23 11:52:34,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {8158#true} assume true; {8158#true} is VALID [2018-11-23 11:52:34,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8158#true} {8158#true} #175#return; {8158#true} is VALID [2018-11-23 11:52:34,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {8158#true} call #t~ret24 := main(); {8158#true} is VALID [2018-11-23 11:52:34,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {8158#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {8158#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {8158#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {8158#true} assume !(~a~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {8158#true} havoc ~i~0;~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {8158#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {8158#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {8158#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {8158#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {8158#true} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {8158#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {8158#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {8158#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {8158#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8158#true} is VALID [2018-11-23 11:52:34,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {8158#true} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 47: Hoare triple {8158#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 48: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {8158#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {8158#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {8158#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 54: Hoare triple {8158#true} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 55: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {8158#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {8158#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,732 INFO L273 TraceCheckUtils]: 61: Hoare triple {8158#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8158#true} is VALID [2018-11-23 11:52:34,733 INFO L273 TraceCheckUtils]: 62: Hoare triple {8158#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; {8359#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:34,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {8359#(< main_~i~0 100000)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8363#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:34,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {8363#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {8158#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 69: Hoare triple {8158#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {8158#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; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {8158#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8158#true} is VALID [2018-11-23 11:52:34,734 INFO L273 TraceCheckUtils]: 72: Hoare triple {8158#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; {8359#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:34,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {8359#(< main_~i~0 100000)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8363#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:34,735 INFO L273 TraceCheckUtils]: 74: Hoare triple {8363#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,735 INFO L273 TraceCheckUtils]: 75: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {8158#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8158#true} is VALID [2018-11-23 11:52:34,735 INFO L273 TraceCheckUtils]: 77: Hoare triple {8158#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 78: Hoare triple {8158#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 79: Hoare triple {8158#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 80: Hoare triple {8158#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 81: Hoare triple {8158#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 82: Hoare triple {8158#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 83: Hoare triple {8158#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {8158#true} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {8158#true} ~i~0 := 0; {8158#true} is VALID [2018-11-23 11:52:34,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {8158#true} 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; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {8158#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {8158#true} 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; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {8158#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 90: Hoare triple {8158#true} 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; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 91: Hoare triple {8158#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 92: Hoare triple {8158#true} 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; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 93: Hoare triple {8158#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8158#true} is VALID [2018-11-23 11:52:34,737 INFO L273 TraceCheckUtils]: 94: Hoare triple {8158#true} assume !(~i~0 < 100000); {8158#true} is VALID [2018-11-23 11:52:34,738 INFO L273 TraceCheckUtils]: 95: Hoare triple {8158#true} ~i~0 := 0; {8460#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:34,738 INFO L273 TraceCheckUtils]: 96: Hoare triple {8460#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8460#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:34,739 INFO L273 TraceCheckUtils]: 97: Hoare triple {8460#(<= main_~i~0 0)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8467#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:34,739 INFO L273 TraceCheckUtils]: 98: Hoare triple {8467#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8467#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:34,739 INFO L273 TraceCheckUtils]: 99: Hoare triple {8467#(<= main_~i~0 1)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8474#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:34,740 INFO L273 TraceCheckUtils]: 100: Hoare triple {8474#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8474#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:34,740 INFO L273 TraceCheckUtils]: 101: Hoare triple {8474#(<= main_~i~0 2)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8481#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:34,740 INFO L273 TraceCheckUtils]: 102: Hoare triple {8481#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {8481#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:34,741 INFO L273 TraceCheckUtils]: 103: Hoare triple {8481#(<= main_~i~0 3)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {8488#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:34,741 INFO L273 TraceCheckUtils]: 104: Hoare triple {8488#(<= main_~i~0 4)} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:34,742 INFO L273 TraceCheckUtils]: 105: Hoare triple {8159#false} ~i~0 := 0; {8159#false} is VALID [2018-11-23 11:52:34,742 INFO L273 TraceCheckUtils]: 106: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:34,742 INFO L273 TraceCheckUtils]: 107: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:34,742 INFO L273 TraceCheckUtils]: 108: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:34,742 INFO L273 TraceCheckUtils]: 109: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:34,743 INFO L273 TraceCheckUtils]: 110: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:34,743 INFO L273 TraceCheckUtils]: 111: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:34,743 INFO L273 TraceCheckUtils]: 112: Hoare triple {8159#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {8159#false} is VALID [2018-11-23 11:52:34,743 INFO L273 TraceCheckUtils]: 113: Hoare triple {8159#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {8159#false} is VALID [2018-11-23 11:52:34,743 INFO L273 TraceCheckUtils]: 114: Hoare triple {8159#false} assume !(~i~0 < 100000); {8159#false} is VALID [2018-11-23 11:52:34,744 INFO L273 TraceCheckUtils]: 115: Hoare triple {8159#false} havoc ~x~0;~x~0 := 0; {8159#false} is VALID [2018-11-23 11:52:34,744 INFO L273 TraceCheckUtils]: 116: Hoare triple {8159#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {8159#false} is VALID [2018-11-23 11:52:34,744 INFO L256 TraceCheckUtils]: 117: Hoare triple {8159#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {8159#false} is VALID [2018-11-23 11:52:34,744 INFO L273 TraceCheckUtils]: 118: Hoare triple {8159#false} ~cond := #in~cond; {8159#false} is VALID [2018-11-23 11:52:34,744 INFO L273 TraceCheckUtils]: 119: Hoare triple {8159#false} assume 0 == ~cond; {8159#false} is VALID [2018-11-23 11:52:34,745 INFO L273 TraceCheckUtils]: 120: Hoare triple {8159#false} assume !false; {8159#false} is VALID [2018-11-23 11:52:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-23 11:52:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:34,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-11-23 11:52:34,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-23 11:52:34,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:34,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:52:34,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:34,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:52:34,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:52:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:34,871 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 19 states. [2018-11-23 11:52:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:36,455 INFO L93 Difference]: Finished difference Result 266 states and 304 transitions. [2018-11-23 11:52:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:36,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-23 11:52:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 241 transitions. [2018-11-23 11:52:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 241 transitions. [2018-11-23 11:52:36,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 241 transitions. [2018-11-23 11:52:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,113 INFO L225 Difference]: With dead ends: 266 [2018-11-23 11:52:37,114 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 11:52:37,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 11:52:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-11-23 11:52:37,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:37,188 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:37,188 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,192 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-11-23 11:52:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-11-23 11:52:37,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,193 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 165 states. [2018-11-23 11:52:37,193 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 165 states. [2018-11-23 11:52:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,197 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-11-23 11:52:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-11-23 11:52:37,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:52:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-11-23 11:52:37,202 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 121 [2018-11-23 11:52:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,203 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-11-23 11:52:37,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:52:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-11-23 11:52:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 11:52:37,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,205 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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:52:37,205 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash 671758534, now seen corresponding path program 10 times [2018-11-23 11:52:37,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2018-11-23 11:52:38,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9509#true} is VALID [2018-11-23 11:52:38,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2018-11-23 11:52:38,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #175#return; {9509#true} is VALID [2018-11-23 11:52:38,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret24 := main(); {9509#true} is VALID [2018-11-23 11:52:38,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {9509#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9511#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {9511#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9511#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {9511#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9512#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {9512#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9512#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {9512#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9513#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {9513#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9513#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {9513#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9514#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {9514#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9514#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {9514#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9515#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {9515#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9515#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {9515#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9516#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {9516#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9516#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {9516#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9517#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {9517#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9517#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {9517#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9518#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {9518#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9518#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {9518#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9519#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9519#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9520#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:38,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {9520#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9520#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {9520#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9521#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {9521#(<= main_~a~0 10)} assume !(~a~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {9510#false} havoc ~i~0;~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,196 INFO L273 TraceCheckUtils]: 37: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 38: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 39: Hoare triple {9510#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {9510#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 55: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 58: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 65: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,200 INFO L273 TraceCheckUtils]: 66: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 67: Hoare triple {9510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 69: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 72: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 73: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,201 INFO L273 TraceCheckUtils]: 74: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 77: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 78: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 79: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 80: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 81: Hoare triple {9510#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 82: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,202 INFO L273 TraceCheckUtils]: 83: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 84: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 85: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 86: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 87: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 88: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 89: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,203 INFO L273 TraceCheckUtils]: 90: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 91: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 92: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 93: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 94: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 95: Hoare triple {9510#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9510#false} is VALID [2018-11-23 11:52:38,204 INFO L273 TraceCheckUtils]: 96: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 97: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 98: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 99: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 101: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,205 INFO L273 TraceCheckUtils]: 102: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 103: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 104: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 105: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 106: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 107: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,206 INFO L273 TraceCheckUtils]: 108: Hoare triple {9510#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 109: Hoare triple {9510#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 110: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 111: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 112: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 113: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,207 INFO L273 TraceCheckUtils]: 114: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 115: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 116: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 117: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 118: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 119: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,208 INFO L273 TraceCheckUtils]: 120: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 121: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 122: Hoare triple {9510#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; {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 123: Hoare triple {9510#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 124: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 125: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,209 INFO L273 TraceCheckUtils]: 126: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 127: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 128: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 129: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 130: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 131: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,210 INFO L273 TraceCheckUtils]: 132: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 133: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 134: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 135: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 136: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 137: Hoare triple {9510#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 138: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,211 INFO L273 TraceCheckUtils]: 139: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 140: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 141: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 142: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 143: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 144: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,212 INFO L273 TraceCheckUtils]: 145: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 146: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 147: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 148: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 149: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 150: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,213 INFO L273 TraceCheckUtils]: 151: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 152: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 153: Hoare triple {9510#false} havoc ~x~0;~x~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 154: Hoare triple {9510#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L256 TraceCheckUtils]: 155: Hoare triple {9510#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 156: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2018-11-23 11:52:38,214 INFO L273 TraceCheckUtils]: 157: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2018-11-23 11:52:38,215 INFO L273 TraceCheckUtils]: 158: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2018-11-23 11:52:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 324 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 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:52:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:38,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:38,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:38,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2018-11-23 11:52:38,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9509#true} is VALID [2018-11-23 11:52:38,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2018-11-23 11:52:38,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #175#return; {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret24 := main(); {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {9509#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {9509#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {9509#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {9509#true} assume !(~a~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {9509#true} havoc ~i~0;~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {9509#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 48: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {9509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 57: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 61: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 63: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 66: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {9509#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 70: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,639 INFO L273 TraceCheckUtils]: 71: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 73: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 78: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {9509#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 84: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 85: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 86: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 87: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 88: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,641 INFO L273 TraceCheckUtils]: 89: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 90: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 91: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 92: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 93: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 94: Hoare triple {9509#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; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 95: Hoare triple {9509#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 96: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 97: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 99: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 100: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 101: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 102: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 103: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 104: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 105: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 106: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,643 INFO L273 TraceCheckUtils]: 107: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 108: Hoare triple {9509#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 109: Hoare triple {9509#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 110: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 111: Hoare triple {9509#true} ~i~0 := 0; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 112: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 113: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 114: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 115: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,644 INFO L273 TraceCheckUtils]: 116: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 117: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 118: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 119: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 120: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 121: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 122: Hoare triple {9509#true} 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; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 123: Hoare triple {9509#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9509#true} is VALID [2018-11-23 11:52:38,645 INFO L273 TraceCheckUtils]: 124: Hoare triple {9509#true} assume !(~i~0 < 100000); {9509#true} is VALID [2018-11-23 11:52:38,646 INFO L273 TraceCheckUtils]: 125: Hoare triple {9509#true} ~i~0 := 0; {9900#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:38,646 INFO L273 TraceCheckUtils]: 126: Hoare triple {9900#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9900#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 127: Hoare triple {9900#(<= main_~i~0 0)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9907#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 128: Hoare triple {9907#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9907#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:38,647 INFO L273 TraceCheckUtils]: 129: Hoare triple {9907#(<= main_~i~0 1)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9914#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:38,648 INFO L273 TraceCheckUtils]: 130: Hoare triple {9914#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9914#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:38,648 INFO L273 TraceCheckUtils]: 131: Hoare triple {9914#(<= main_~i~0 2)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9921#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:38,648 INFO L273 TraceCheckUtils]: 132: Hoare triple {9921#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9921#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:38,649 INFO L273 TraceCheckUtils]: 133: Hoare triple {9921#(<= main_~i~0 3)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9928#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:38,649 INFO L273 TraceCheckUtils]: 134: Hoare triple {9928#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9928#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:38,650 INFO L273 TraceCheckUtils]: 135: Hoare triple {9928#(<= main_~i~0 4)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9935#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:38,650 INFO L273 TraceCheckUtils]: 136: Hoare triple {9935#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9935#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:38,651 INFO L273 TraceCheckUtils]: 137: Hoare triple {9935#(<= main_~i~0 5)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9942#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:38,652 INFO L273 TraceCheckUtils]: 138: Hoare triple {9942#(<= main_~i~0 6)} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,652 INFO L273 TraceCheckUtils]: 139: Hoare triple {9510#false} ~i~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,652 INFO L273 TraceCheckUtils]: 140: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,652 INFO L273 TraceCheckUtils]: 141: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,652 INFO L273 TraceCheckUtils]: 142: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,653 INFO L273 TraceCheckUtils]: 143: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,653 INFO L273 TraceCheckUtils]: 144: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,653 INFO L273 TraceCheckUtils]: 145: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,653 INFO L273 TraceCheckUtils]: 146: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,653 INFO L273 TraceCheckUtils]: 147: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 148: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 149: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 150: Hoare triple {9510#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 151: Hoare triple {9510#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 152: Hoare triple {9510#false} assume !(~i~0 < 100000); {9510#false} is VALID [2018-11-23 11:52:38,654 INFO L273 TraceCheckUtils]: 153: Hoare triple {9510#false} havoc ~x~0;~x~0 := 0; {9510#false} is VALID [2018-11-23 11:52:38,655 INFO L273 TraceCheckUtils]: 154: Hoare triple {9510#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {9510#false} is VALID [2018-11-23 11:52:38,655 INFO L256 TraceCheckUtils]: 155: Hoare triple {9510#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {9510#false} is VALID [2018-11-23 11:52:38,655 INFO L273 TraceCheckUtils]: 156: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2018-11-23 11:52:38,655 INFO L273 TraceCheckUtils]: 157: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2018-11-23 11:52:38,655 INFO L273 TraceCheckUtils]: 158: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2018-11-23 11:52:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-23 11:52:38,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:38,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:52:38,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-23 11:52:38,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:38,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:38,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:38,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:38,807 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 20 states. [2018-11-23 11:52:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,621 INFO L93 Difference]: Finished difference Result 331 states and 360 transitions. [2018-11-23 11:52:40,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:40,622 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-23 11:52:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2018-11-23 11:52:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2018-11-23 11:52:40,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 261 transitions. [2018-11-23 11:52:41,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:41,340 INFO L225 Difference]: With dead ends: 331 [2018-11-23 11:52:41,340 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:52:41,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:52:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2018-11-23 11:52:41,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:41,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 184 states. [2018-11-23 11:52:41,428 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 184 states. [2018-11-23 11:52:41,429 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 184 states. [2018-11-23 11:52:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,433 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-11-23 11:52:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-23 11:52:41,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,434 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 194 states. [2018-11-23 11:52:41,434 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 194 states. [2018-11-23 11:52:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,438 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-11-23 11:52:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-23 11:52:41,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:41,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 11:52:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-11-23 11:52:41,444 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 159 [2018-11-23 11:52:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:41,444 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-11-23 11:52:41,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-11-23 11:52:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 11:52:41,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:41,447 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 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, 1, 1, 1, 1] [2018-11-23 11:52:41,447 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:41,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 851161394, now seen corresponding path program 11 times [2018-11-23 11:52:41,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {11156#true} call ULTIMATE.init(); {11156#true} is VALID [2018-11-23 11:52:42,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {11156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11156#true} is VALID [2018-11-23 11:52:42,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {11156#true} assume true; {11156#true} is VALID [2018-11-23 11:52:42,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11156#true} {11156#true} #175#return; {11156#true} is VALID [2018-11-23 11:52:42,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {11156#true} call #t~ret24 := main(); {11156#true} is VALID [2018-11-23 11:52:42,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {11156#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11158#(= main_~a~0 0)} is VALID [2018-11-23 11:52:42,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {11158#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11158#(= main_~a~0 0)} is VALID [2018-11-23 11:52:42,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {11158#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11159#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {11159#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11159#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {11159#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11160#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {11160#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11160#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {11160#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11161#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {11161#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11161#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {11161#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11162#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {11162#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11162#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {11162#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11163#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {11163#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11163#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {11163#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11164#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {11164#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11164#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {11164#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11165#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {11165#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11165#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {11165#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11166#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {11166#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11166#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {11166#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11167#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {11167#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11167#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {11167#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11168#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {11168#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11168#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {11168#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11169#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:42,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {11169#(<= main_~a~0 11)} assume !(~a~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {11157#false} havoc ~i~0;~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,449 INFO L273 TraceCheckUtils]: 36: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {11157#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 45: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 46: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 47: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 48: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 56: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 57: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 58: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:52:42,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 64: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 65: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 66: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 67: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 68: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,453 INFO L273 TraceCheckUtils]: 69: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 70: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 71: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 72: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 73: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 74: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 75: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 80: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 82: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 83: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 84: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 85: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 86: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,455 INFO L273 TraceCheckUtils]: 87: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 88: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 89: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 90: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 91: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 92: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 93: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 94: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 95: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,456 INFO L273 TraceCheckUtils]: 96: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 97: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 98: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 99: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 100: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 101: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 102: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 103: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 104: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,457 INFO L273 TraceCheckUtils]: 105: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 106: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 107: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 108: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 109: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 110: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 111: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 112: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 113: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,458 INFO L273 TraceCheckUtils]: 114: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 115: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 116: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 117: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 118: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 119: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 120: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 121: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 122: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:52:42,459 INFO L273 TraceCheckUtils]: 123: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 124: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 125: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 126: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 127: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 128: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 129: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 130: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,460 INFO L273 TraceCheckUtils]: 131: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 132: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 133: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 134: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 135: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 136: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 137: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,461 INFO L273 TraceCheckUtils]: 138: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 139: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 140: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 141: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 142: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 143: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 144: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 145: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 146: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,462 INFO L273 TraceCheckUtils]: 147: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 148: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 149: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 150: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 151: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 152: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 153: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 154: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 155: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:52:42,463 INFO L273 TraceCheckUtils]: 156: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 157: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 158: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 159: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 160: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 161: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 162: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 163: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 164: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,464 INFO L273 TraceCheckUtils]: 165: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 166: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 167: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 168: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 169: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 170: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 171: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 172: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 173: Hoare triple {11157#false} havoc ~x~0;~x~0 := 0; {11157#false} is VALID [2018-11-23 11:52:42,465 INFO L273 TraceCheckUtils]: 174: Hoare triple {11157#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {11157#false} is VALID [2018-11-23 11:52:42,466 INFO L256 TraceCheckUtils]: 175: Hoare triple {11157#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {11157#false} is VALID [2018-11-23 11:52:42,466 INFO L273 TraceCheckUtils]: 176: Hoare triple {11157#false} ~cond := #in~cond; {11157#false} is VALID [2018-11-23 11:52:42,466 INFO L273 TraceCheckUtils]: 177: Hoare triple {11157#false} assume 0 == ~cond; {11157#false} is VALID [2018-11-23 11:52:42,466 INFO L273 TraceCheckUtils]: 178: Hoare triple {11157#false} assume !false; {11157#false} is VALID [2018-11-23 11:52:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 11:52:42,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:42,478 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:52:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:56,739 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:53:56,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:56,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:57,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {11156#true} call ULTIMATE.init(); {11156#true} is VALID [2018-11-23 11:53:57,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {11156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11156#true} is VALID [2018-11-23 11:53:57,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {11156#true} assume true; {11156#true} is VALID [2018-11-23 11:53:57,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11156#true} {11156#true} #175#return; {11156#true} is VALID [2018-11-23 11:53:57,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {11156#true} call #t~ret24 := main(); {11156#true} is VALID [2018-11-23 11:53:57,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {11156#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11156#true} is VALID [2018-11-23 11:53:57,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {11156#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11156#true} is VALID [2018-11-23 11:53:57,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {11156#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11156#true} is VALID [2018-11-23 11:53:57,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {11156#true} assume !(~a~0 < 100000); {11156#true} is VALID [2018-11-23 11:53:57,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {11156#true} havoc ~i~0;~i~0 := 0; {11260#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:57,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {11260#(<= 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; {11260#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:57,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {11260#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11267#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:57,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {11267#(<= 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; {11267#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:57,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {11267#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11274#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:57,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {11274#(<= 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; {11274#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:57,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {11274#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:57,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {11281#(<= 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; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:57,071 INFO L273 TraceCheckUtils]: 37: Hoare triple {11281#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11288#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:57,071 INFO L273 TraceCheckUtils]: 38: Hoare triple {11288#(<= 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; {11288#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:57,072 INFO L273 TraceCheckUtils]: 39: Hoare triple {11288#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11295#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:57,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {11295#(<= 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; {11295#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:57,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {11295#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11302#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:57,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {11302#(<= 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; {11302#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:57,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {11302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11309#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:57,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {11309#(<= main_~i~0 7)} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,076 INFO L273 TraceCheckUtils]: 47: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,076 INFO L273 TraceCheckUtils]: 48: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,076 INFO L273 TraceCheckUtils]: 49: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 53: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 55: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 56: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 58: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 59: Hoare triple {11157#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 72: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 73: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,079 INFO L273 TraceCheckUtils]: 74: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 75: Hoare triple {11157#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 76: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 77: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 79: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 80: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 81: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 84: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 85: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 86: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 87: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 88: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 89: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 90: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {11157#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11157#false} is VALID [2018-11-23 11:53:57,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 95: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 96: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 99: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,082 INFO L273 TraceCheckUtils]: 101: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 102: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 103: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 104: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 105: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 106: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {11157#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 108: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 109: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,083 INFO L273 TraceCheckUtils]: 110: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 111: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 112: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 113: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 114: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 115: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 116: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 117: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 118: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,084 INFO L273 TraceCheckUtils]: 119: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 120: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 121: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 122: Hoare triple {11157#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 123: Hoare triple {11157#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 124: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 125: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 126: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 127: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,085 INFO L273 TraceCheckUtils]: 128: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 129: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 130: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 131: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 132: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 133: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 135: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,086 INFO L273 TraceCheckUtils]: 136: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 137: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 138: Hoare triple {11157#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; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 139: Hoare triple {11157#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 140: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 141: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 142: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 143: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 144: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,087 INFO L273 TraceCheckUtils]: 145: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 146: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 147: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 148: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 149: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 150: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 151: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 152: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 153: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,088 INFO L273 TraceCheckUtils]: 154: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 155: Hoare triple {11157#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 156: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 157: Hoare triple {11157#false} ~i~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 158: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 159: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 160: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 161: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,089 INFO L273 TraceCheckUtils]: 162: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 163: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 164: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 165: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 166: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 167: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 168: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 169: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 170: Hoare triple {11157#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {11157#false} is VALID [2018-11-23 11:53:57,090 INFO L273 TraceCheckUtils]: 171: Hoare triple {11157#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 172: Hoare triple {11157#false} assume !(~i~0 < 100000); {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 173: Hoare triple {11157#false} havoc ~x~0;~x~0 := 0; {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 174: Hoare triple {11157#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L256 TraceCheckUtils]: 175: Hoare triple {11157#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 176: Hoare triple {11157#false} ~cond := #in~cond; {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 177: Hoare triple {11157#false} assume 0 == ~cond; {11157#false} is VALID [2018-11-23 11:53:57,091 INFO L273 TraceCheckUtils]: 178: Hoare triple {11157#false} assume !false; {11157#false} is VALID [2018-11-23 11:53:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-23 11:53:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-11-23 11:53:57,135 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-23 11:53:57,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:57,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:53:57,218 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:53:57,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:53:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:53:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:57,220 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 22 states. [2018-11-23 11:53:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:58,687 INFO L93 Difference]: Finished difference Result 369 states and 398 transitions. [2018-11-23 11:53:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:53:58,687 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-23 11:53:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 281 transitions. [2018-11-23 11:53:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:53:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 281 transitions. [2018-11-23 11:53:58,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 281 transitions. [2018-11-23 11:54:00,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:00,264 INFO L225 Difference]: With dead ends: 369 [2018-11-23 11:54:00,265 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 11:54:00,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:54:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 11:54:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 204. [2018-11-23 11:54:00,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:00,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 204 states. [2018-11-23 11:54:00,359 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 204 states. [2018-11-23 11:54:00,359 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 204 states. [2018-11-23 11:54:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:00,365 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-11-23 11:54:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 224 transitions. [2018-11-23 11:54:00,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:00,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:00,366 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 214 states. [2018-11-23 11:54:00,366 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 214 states. [2018-11-23 11:54:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:00,370 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-11-23 11:54:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 224 transitions. [2018-11-23 11:54:00,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:00,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:00,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:00,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 11:54:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-11-23 11:54:00,375 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 179 [2018-11-23 11:54:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:00,376 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-11-23 11:54:00,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:54:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-11-23 11:54:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 11:54:00,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:00,378 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 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, 1, 1, 1, 1] [2018-11-23 11:54:00,378 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:00,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1486056350, now seen corresponding path program 12 times [2018-11-23 11:54:00,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:00,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:00,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:00,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {12992#true} call ULTIMATE.init(); {12992#true} is VALID [2018-11-23 11:54:00,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {12992#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12992#true} is VALID [2018-11-23 11:54:00,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {12992#true} assume true; {12992#true} is VALID [2018-11-23 11:54:00,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12992#true} {12992#true} #175#return; {12992#true} is VALID [2018-11-23 11:54:00,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {12992#true} call #t~ret24 := main(); {12992#true} is VALID [2018-11-23 11:54:00,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {12992#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12994#(= main_~a~0 0)} is VALID [2018-11-23 11:54:00,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {12994#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12994#(= main_~a~0 0)} is VALID [2018-11-23 11:54:00,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {12994#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12995#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:00,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {12995#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12995#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:00,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {12995#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12996#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:00,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {12996#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12996#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:00,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {12996#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12997#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:00,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {12997#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12997#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:00,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {12997#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12998#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:00,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {12998#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12998#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:00,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {12998#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12999#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:00,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {12999#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12999#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:00,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {12999#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13000#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:00,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {13000#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13000#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:00,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {13000#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13001#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:00,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {13001#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13001#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:00,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {13001#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13002#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:00,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {13002#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13002#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:00,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {13002#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13003#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:00,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {13003#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13003#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:00,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {13003#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13004#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:00,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {13004#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13004#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:00,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {13004#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13005#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:00,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {13005#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13005#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:00,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {13005#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13006#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {13006#(<= main_~a~0 12)} assume !(~a~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {12993#false} havoc ~i~0;~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {12993#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 62: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 64: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {12993#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 66: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 70: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 71: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,718 INFO L273 TraceCheckUtils]: 72: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 73: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 75: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 76: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,719 INFO L273 TraceCheckUtils]: 81: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 83: Hoare triple {12993#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 85: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 87: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 91: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 92: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 93: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 94: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 95: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 96: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,721 INFO L273 TraceCheckUtils]: 99: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 100: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 101: Hoare triple {12993#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 102: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 104: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 105: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 106: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 111: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 112: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 113: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 114: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 115: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 116: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 118: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 119: Hoare triple {12993#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 120: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 121: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 122: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 123: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 124: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 125: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,724 INFO L273 TraceCheckUtils]: 126: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 127: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 128: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 129: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 130: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 131: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 132: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 133: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 134: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,725 INFO L273 TraceCheckUtils]: 135: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 136: Hoare triple {12993#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 137: Hoare triple {12993#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 138: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 139: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 140: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 141: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 142: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,726 INFO L273 TraceCheckUtils]: 143: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 144: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 145: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 146: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 147: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 148: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 149: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 150: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 151: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,727 INFO L273 TraceCheckUtils]: 152: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 153: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 154: Hoare triple {12993#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; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 155: Hoare triple {12993#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 156: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 157: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 158: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 159: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 160: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,728 INFO L273 TraceCheckUtils]: 161: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 162: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 163: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 164: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 165: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 166: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 167: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 168: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 169: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,729 INFO L273 TraceCheckUtils]: 170: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 171: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 172: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 173: Hoare triple {12993#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 174: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 175: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 176: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 177: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 178: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,730 INFO L273 TraceCheckUtils]: 179: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 180: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 181: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 182: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 183: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 184: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 185: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 186: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 187: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,731 INFO L273 TraceCheckUtils]: 188: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 189: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 190: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 191: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 192: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 193: Hoare triple {12993#false} havoc ~x~0;~x~0 := 0; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 194: Hoare triple {12993#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L256 TraceCheckUtils]: 195: Hoare triple {12993#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 196: Hoare triple {12993#false} ~cond := #in~cond; {12993#false} is VALID [2018-11-23 11:54:00,732 INFO L273 TraceCheckUtils]: 197: Hoare triple {12993#false} assume 0 == ~cond; {12993#false} is VALID [2018-11-23 11:54:00,733 INFO L273 TraceCheckUtils]: 198: Hoare triple {12993#false} assume !false; {12993#false} is VALID [2018-11-23 11:54:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-23 11:54:00,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:00,747 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:00,755 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:52,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:54:52,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:52,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {12992#true} call ULTIMATE.init(); {12992#true} is VALID [2018-11-23 11:54:52,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {12992#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12992#true} is VALID [2018-11-23 11:54:52,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {12992#true} assume true; {12992#true} is VALID [2018-11-23 11:54:52,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12992#true} {12992#true} #175#return; {12992#true} is VALID [2018-11-23 11:54:52,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {12992#true} call #t~ret24 := main(); {12992#true} is VALID [2018-11-23 11:54:52,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {12992#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {12992#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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {12992#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {12992#true} assume !(~a~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {12992#true} havoc ~i~0;~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {12992#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {12992#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,783 INFO L273 TraceCheckUtils]: 69: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 70: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 73: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 74: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,784 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 79: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 80: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,785 INFO L273 TraceCheckUtils]: 81: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,786 INFO L273 TraceCheckUtils]: 83: Hoare triple {12992#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12992#true} is VALID [2018-11-23 11:54:52,786 INFO L273 TraceCheckUtils]: 84: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,786 INFO L273 TraceCheckUtils]: 85: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,786 INFO L273 TraceCheckUtils]: 86: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 87: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 88: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 89: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 90: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 91: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 93: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 94: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 95: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 96: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 97: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,788 INFO L273 TraceCheckUtils]: 98: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 100: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 101: Hoare triple {12992#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 102: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 103: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,789 INFO L273 TraceCheckUtils]: 104: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 106: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 107: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 108: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 109: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 114: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 115: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,791 INFO L273 TraceCheckUtils]: 116: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 118: Hoare triple {12992#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; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {12992#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,792 INFO L273 TraceCheckUtils]: 123: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 127: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 128: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 130: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 131: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 132: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 133: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,794 INFO L273 TraceCheckUtils]: 135: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 136: Hoare triple {12992#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 137: Hoare triple {12992#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 138: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 139: Hoare triple {12992#true} ~i~0 := 0; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 140: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 141: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,795 INFO L273 TraceCheckUtils]: 142: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 143: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 144: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 145: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 146: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 147: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,796 INFO L273 TraceCheckUtils]: 148: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 149: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 150: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 151: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 152: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 153: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,797 INFO L273 TraceCheckUtils]: 154: Hoare triple {12992#true} 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; {12992#true} is VALID [2018-11-23 11:54:52,798 INFO L273 TraceCheckUtils]: 155: Hoare triple {12992#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12992#true} is VALID [2018-11-23 11:54:52,798 INFO L273 TraceCheckUtils]: 156: Hoare triple {12992#true} assume !(~i~0 < 100000); {12992#true} is VALID [2018-11-23 11:54:52,818 INFO L273 TraceCheckUtils]: 157: Hoare triple {12992#true} ~i~0 := 0; {13481#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,818 INFO L273 TraceCheckUtils]: 158: Hoare triple {13481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13481#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,824 INFO L273 TraceCheckUtils]: 159: Hoare triple {13481#(<= main_~i~0 0)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13488#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,824 INFO L273 TraceCheckUtils]: 160: Hoare triple {13488#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13488#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,827 INFO L273 TraceCheckUtils]: 161: Hoare triple {13488#(<= main_~i~0 1)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13495#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,827 INFO L273 TraceCheckUtils]: 162: Hoare triple {13495#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13495#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,827 INFO L273 TraceCheckUtils]: 163: Hoare triple {13495#(<= main_~i~0 2)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13502#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:52,828 INFO L273 TraceCheckUtils]: 164: Hoare triple {13502#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13502#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:52,828 INFO L273 TraceCheckUtils]: 165: Hoare triple {13502#(<= main_~i~0 3)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13509#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:52,828 INFO L273 TraceCheckUtils]: 166: Hoare triple {13509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13509#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:52,829 INFO L273 TraceCheckUtils]: 167: Hoare triple {13509#(<= main_~i~0 4)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13516#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:52,829 INFO L273 TraceCheckUtils]: 168: Hoare triple {13516#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13516#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:52,830 INFO L273 TraceCheckUtils]: 169: Hoare triple {13516#(<= main_~i~0 5)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13523#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:52,830 INFO L273 TraceCheckUtils]: 170: Hoare triple {13523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13523#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:52,830 INFO L273 TraceCheckUtils]: 171: Hoare triple {13523#(<= main_~i~0 6)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13530#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:52,831 INFO L273 TraceCheckUtils]: 172: Hoare triple {13530#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {13530#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:52,831 INFO L273 TraceCheckUtils]: 173: Hoare triple {13530#(<= main_~i~0 7)} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {13537#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:52,832 INFO L273 TraceCheckUtils]: 174: Hoare triple {13537#(<= main_~i~0 8)} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:52,832 INFO L273 TraceCheckUtils]: 175: Hoare triple {12993#false} ~i~0 := 0; {12993#false} is VALID [2018-11-23 11:54:52,832 INFO L273 TraceCheckUtils]: 176: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,832 INFO L273 TraceCheckUtils]: 177: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,833 INFO L273 TraceCheckUtils]: 178: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,833 INFO L273 TraceCheckUtils]: 179: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,833 INFO L273 TraceCheckUtils]: 180: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,833 INFO L273 TraceCheckUtils]: 181: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,833 INFO L273 TraceCheckUtils]: 182: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 183: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 184: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 185: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 186: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 187: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,834 INFO L273 TraceCheckUtils]: 188: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 189: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 190: Hoare triple {12993#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 191: Hoare triple {12993#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 192: Hoare triple {12993#false} assume !(~i~0 < 100000); {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 193: Hoare triple {12993#false} havoc ~x~0;~x~0 := 0; {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L273 TraceCheckUtils]: 194: Hoare triple {12993#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {12993#false} is VALID [2018-11-23 11:54:52,835 INFO L256 TraceCheckUtils]: 195: Hoare triple {12993#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {12993#false} is VALID [2018-11-23 11:54:52,836 INFO L273 TraceCheckUtils]: 196: Hoare triple {12993#false} ~cond := #in~cond; {12993#false} is VALID [2018-11-23 11:54:52,836 INFO L273 TraceCheckUtils]: 197: Hoare triple {12993#false} assume 0 == ~cond; {12993#false} is VALID [2018-11-23 11:54:52,836 INFO L273 TraceCheckUtils]: 198: Hoare triple {12993#false} assume !false; {12993#false} is VALID [2018-11-23 11:54:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-11-23 11:54:52,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:52,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-23 11:54:52,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 199 [2018-11-23 11:54:52,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:52,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:54:52,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:54:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:54:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:54:52,993 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 24 states. [2018-11-23 11:54:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,001 INFO L93 Difference]: Finished difference Result 407 states and 436 transitions. [2018-11-23 11:54:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:54:55,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 199 [2018-11-23 11:54:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2018-11-23 11:54:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2018-11-23 11:54:55,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 301 transitions. [2018-11-23 11:54:55,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,297 INFO L225 Difference]: With dead ends: 407 [2018-11-23 11:54:55,297 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 11:54:55,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:54:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 11:54:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 224. [2018-11-23 11:54:55,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:55,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 224 states. [2018-11-23 11:54:55,440 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 224 states. [2018-11-23 11:54:55,440 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 224 states. [2018-11-23 11:54:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,445 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-11-23 11:54:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 244 transitions. [2018-11-23 11:54:55,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,446 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 234 states. [2018-11-23 11:54:55,446 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 234 states. [2018-11-23 11:54:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,451 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-11-23 11:54:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 244 transitions. [2018-11-23 11:54:55,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:55,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-23 11:54:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 234 transitions. [2018-11-23 11:54:55,457 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 234 transitions. Word has length 199 [2018-11-23 11:54:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:55,458 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 234 transitions. [2018-11-23 11:54:55,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:54:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 234 transitions. [2018-11-23 11:54:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-23 11:54:55,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:55,461 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-11-23 11:54:55,461 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:55,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1539282934, now seen corresponding path program 13 times [2018-11-23 11:54:55,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:55,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {15017#true} call ULTIMATE.init(); {15017#true} is VALID [2018-11-23 11:54:55,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {15017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15017#true} is VALID [2018-11-23 11:54:55,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {15017#true} assume true; {15017#true} is VALID [2018-11-23 11:54:55,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15017#true} {15017#true} #175#return; {15017#true} is VALID [2018-11-23 11:54:55,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {15017#true} call #t~ret24 := main(); {15017#true} is VALID [2018-11-23 11:54:55,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {15017#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15019#(= main_~a~0 0)} is VALID [2018-11-23 11:54:55,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {15019#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15019#(= main_~a~0 0)} is VALID [2018-11-23 11:54:55,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {15019#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15020#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:55,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {15020#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15020#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:55,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15021#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:55,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15021#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:55,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {15021#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15022#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:55,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {15022#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15022#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:55,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {15022#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15023#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:55,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {15023#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15023#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:55,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {15023#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15024#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:55,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {15024#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15024#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:55,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {15024#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15025#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:55,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {15025#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15025#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:55,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {15025#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15026#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:55,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {15026#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15026#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:55,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {15026#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15027#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:55,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {15027#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15027#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:55,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {15027#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15028#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:55,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {15028#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15028#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:55,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {15028#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15029#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:55,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {15029#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15029#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {15029#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15030#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:55,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {15030#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15030#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:55,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {15030#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15031#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {15031#(<= main_~a~0 12)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15031#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:55,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {15031#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15032#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {15032#(<= main_~a~0 13)} assume !(~a~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {15018#false} havoc ~i~0;~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 42: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 49: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 69: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 76: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 77: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,835 INFO L273 TraceCheckUtils]: 80: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 81: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 82: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 83: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 85: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 86: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,836 INFO L273 TraceCheckUtils]: 89: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 93: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 94: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 95: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 96: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 97: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,837 INFO L273 TraceCheckUtils]: 98: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 99: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 100: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 102: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 103: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 104: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 105: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 106: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,838 INFO L273 TraceCheckUtils]: 107: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 108: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 109: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 110: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 111: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 112: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 113: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 114: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,839 INFO L273 TraceCheckUtils]: 115: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 116: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 117: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 118: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 119: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 120: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 121: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 122: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 123: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,840 INFO L273 TraceCheckUtils]: 124: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,863 INFO L273 TraceCheckUtils]: 125: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,863 INFO L273 TraceCheckUtils]: 126: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,863 INFO L273 TraceCheckUtils]: 127: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,863 INFO L273 TraceCheckUtils]: 128: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,863 INFO L273 TraceCheckUtils]: 129: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 130: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 131: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 132: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 133: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 134: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 135: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,864 INFO L273 TraceCheckUtils]: 136: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,865 INFO L273 TraceCheckUtils]: 137: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,865 INFO L273 TraceCheckUtils]: 138: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,865 INFO L273 TraceCheckUtils]: 139: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,865 INFO L273 TraceCheckUtils]: 140: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,865 INFO L273 TraceCheckUtils]: 141: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 142: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 143: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 144: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 145: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 146: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 147: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 148: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 149: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,866 INFO L273 TraceCheckUtils]: 150: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 151: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 152: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 153: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 154: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 155: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 156: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 157: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 158: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,867 INFO L273 TraceCheckUtils]: 159: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 160: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 161: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 162: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 163: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 164: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 165: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 166: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,868 INFO L273 TraceCheckUtils]: 167: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 168: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 169: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 170: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 171: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 172: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 173: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 174: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 175: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,869 INFO L273 TraceCheckUtils]: 176: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 177: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 178: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 179: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 180: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 181: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 182: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 183: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 184: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,870 INFO L273 TraceCheckUtils]: 185: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 186: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 187: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 188: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 189: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 190: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 191: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 192: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 193: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,871 INFO L273 TraceCheckUtils]: 194: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 195: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 196: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 197: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 198: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 199: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 200: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 201: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 202: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,872 INFO L273 TraceCheckUtils]: 203: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 204: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 205: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 206: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 207: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 208: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 209: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 210: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 211: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:55,873 INFO L273 TraceCheckUtils]: 212: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L273 TraceCheckUtils]: 213: Hoare triple {15018#false} havoc ~x~0;~x~0 := 0; {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L273 TraceCheckUtils]: 214: Hoare triple {15018#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L256 TraceCheckUtils]: 215: Hoare triple {15018#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L273 TraceCheckUtils]: 216: Hoare triple {15018#false} ~cond := #in~cond; {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L273 TraceCheckUtils]: 217: Hoare triple {15018#false} assume 0 == ~cond; {15018#false} is VALID [2018-11-23 11:54:55,874 INFO L273 TraceCheckUtils]: 218: Hoare triple {15018#false} assume !false; {15018#false} is VALID [2018-11-23 11:54:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:54:55,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:56,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {15017#true} call ULTIMATE.init(); {15017#true} is VALID [2018-11-23 11:54:56,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {15017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15017#true} is VALID [2018-11-23 11:54:56,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {15017#true} assume true; {15017#true} is VALID [2018-11-23 11:54:56,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15017#true} {15017#true} #175#return; {15017#true} is VALID [2018-11-23 11:54:56,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {15017#true} call #t~ret24 := main(); {15017#true} is VALID [2018-11-23 11:54:56,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {15017#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15051#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:56,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {15051#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15051#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:56,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {15051#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15020#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:56,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {15020#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15020#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:56,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15021#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:56,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15021#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:56,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {15021#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15022#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:56,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {15022#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15022#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:56,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {15022#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15023#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:56,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {15023#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15023#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:56,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {15023#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15024#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:56,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {15024#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15024#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:56,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {15024#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15025#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:56,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {15025#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15025#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:56,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {15025#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15026#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:56,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {15026#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15026#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:56,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {15026#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15027#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:56,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {15027#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15027#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:56,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {15027#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15028#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:56,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {15028#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15028#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:56,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {15028#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15029#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:56,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {15029#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15029#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:56,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {15029#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15030#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:56,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {15030#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15030#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:56,340 INFO L273 TraceCheckUtils]: 29: Hoare triple {15030#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15031#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:56,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {15031#(<= main_~a~0 12)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15031#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:56,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {15031#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15032#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:56,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {15032#(<= main_~a~0 13)} assume !(~a~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {15018#false} havoc ~i~0;~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 42: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,343 INFO L273 TraceCheckUtils]: 43: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,344 INFO L273 TraceCheckUtils]: 44: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {15018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,345 INFO L273 TraceCheckUtils]: 54: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 56: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 58: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 59: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 60: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 61: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,346 INFO L273 TraceCheckUtils]: 62: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 63: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 64: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 65: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 66: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 67: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 68: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {15018#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 72: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 75: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 76: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 77: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 78: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,348 INFO L273 TraceCheckUtils]: 79: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 83: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 85: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 86: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 87: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,349 INFO L273 TraceCheckUtils]: 88: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 89: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 91: Hoare triple {15018#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 92: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 93: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 94: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 95: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 96: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,350 INFO L273 TraceCheckUtils]: 97: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 98: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 99: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 100: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 101: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 102: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 103: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 104: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 105: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,351 INFO L273 TraceCheckUtils]: 106: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 107: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 108: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 109: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 110: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 111: Hoare triple {15018#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 112: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 114: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,352 INFO L273 TraceCheckUtils]: 115: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 116: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 117: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 118: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 119: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 120: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 121: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 122: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 123: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,353 INFO L273 TraceCheckUtils]: 124: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 125: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 126: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 127: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 128: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 129: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 130: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 131: Hoare triple {15018#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 132: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,354 INFO L273 TraceCheckUtils]: 133: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 134: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 135: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 136: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 137: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 138: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 139: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 140: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 141: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,355 INFO L273 TraceCheckUtils]: 142: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 143: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 144: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 145: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 146: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 147: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 148: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 149: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 150: Hoare triple {15018#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {15018#false} is VALID [2018-11-23 11:54:56,356 INFO L273 TraceCheckUtils]: 151: Hoare triple {15018#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 152: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 153: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 154: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 155: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 156: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 157: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 158: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,357 INFO L273 TraceCheckUtils]: 159: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 160: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 161: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 162: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 163: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 164: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 165: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 166: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 167: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,358 INFO L273 TraceCheckUtils]: 168: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 169: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 170: Hoare triple {15018#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; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 171: Hoare triple {15018#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 172: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 173: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 174: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 175: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 176: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,359 INFO L273 TraceCheckUtils]: 177: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 178: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 179: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 180: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 181: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 182: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 183: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 184: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 185: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,360 INFO L273 TraceCheckUtils]: 186: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 187: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 188: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 189: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 190: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 191: Hoare triple {15018#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 192: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 193: Hoare triple {15018#false} ~i~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 194: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,361 INFO L273 TraceCheckUtils]: 195: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 196: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 197: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 198: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 199: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 200: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 201: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 202: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 203: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,362 INFO L273 TraceCheckUtils]: 204: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 205: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 206: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 207: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 208: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 209: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 210: Hoare triple {15018#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 211: Hoare triple {15018#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 212: Hoare triple {15018#false} assume !(~i~0 < 100000); {15018#false} is VALID [2018-11-23 11:54:56,363 INFO L273 TraceCheckUtils]: 213: Hoare triple {15018#false} havoc ~x~0;~x~0 := 0; {15018#false} is VALID [2018-11-23 11:54:56,364 INFO L273 TraceCheckUtils]: 214: Hoare triple {15018#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {15018#false} is VALID [2018-11-23 11:54:56,364 INFO L256 TraceCheckUtils]: 215: Hoare triple {15018#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {15018#false} is VALID [2018-11-23 11:54:56,364 INFO L273 TraceCheckUtils]: 216: Hoare triple {15018#false} ~cond := #in~cond; {15018#false} is VALID [2018-11-23 11:54:56,364 INFO L273 TraceCheckUtils]: 217: Hoare triple {15018#false} assume 0 == ~cond; {15018#false} is VALID [2018-11-23 11:54:56,364 INFO L273 TraceCheckUtils]: 218: Hoare triple {15018#false} assume !false; {15018#false} is VALID [2018-11-23 11:54:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:54:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:54:56,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 219 [2018-11-23 11:54:56,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:56,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:54:56,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:54:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:54:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:54:56,499 INFO L87 Difference]: Start difference. First operand 224 states and 234 transitions. Second operand 17 states. [2018-11-23 11:54:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,476 INFO L93 Difference]: Finished difference Result 418 states and 438 transitions. [2018-11-23 11:54:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:54:57,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 219 [2018-11-23 11:54:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:54:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2018-11-23 11:54:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:54:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2018-11-23 11:54:57,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 132 transitions. [2018-11-23 11:54:57,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:57,601 INFO L225 Difference]: With dead ends: 418 [2018-11-23 11:54:57,601 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 11:54:57,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:54:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 11:54:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-11-23 11:54:57,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:57,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 226 states. [2018-11-23 11:54:57,780 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 226 states. [2018-11-23 11:54:57,781 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 226 states. [2018-11-23 11:54:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,784 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2018-11-23 11:54:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 237 transitions. [2018-11-23 11:54:57,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:57,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:57,785 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 227 states. [2018-11-23 11:54:57,785 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 227 states. [2018-11-23 11:54:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,790 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2018-11-23 11:54:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 237 transitions. [2018-11-23 11:54:57,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:57,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:57,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:57,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-23 11:54:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 236 transitions. [2018-11-23 11:54:57,796 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 236 transitions. Word has length 219 [2018-11-23 11:54:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:57,796 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 236 transitions. [2018-11-23 11:54:57,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:54:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 236 transitions. [2018-11-23 11:54:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-23 11:54:57,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:57,798 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-11-23 11:54:57,798 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:57,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash 434734376, now seen corresponding path program 14 times [2018-11-23 11:54:57,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:57,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {17105#true} call ULTIMATE.init(); {17105#true} is VALID [2018-11-23 11:54:58,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {17105#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17105#true} is VALID [2018-11-23 11:54:58,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {17105#true} assume true; {17105#true} is VALID [2018-11-23 11:54:58,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17105#true} {17105#true} #175#return; {17105#true} is VALID [2018-11-23 11:54:58,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {17105#true} call #t~ret24 := main(); {17105#true} is VALID [2018-11-23 11:54:58,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {17105#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17107#(= main_~a~0 0)} is VALID [2018-11-23 11:54:58,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {17107#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17107#(= main_~a~0 0)} is VALID [2018-11-23 11:54:58,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {17107#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17108#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:58,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {17108#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17108#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:58,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {17108#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17109#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:58,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {17109#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17109#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:58,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {17109#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:58,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {17110#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17110#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:58,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {17110#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17111#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:58,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {17111#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17111#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:58,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {17111#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17112#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:58,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {17112#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17112#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:58,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {17112#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17113#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:58,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {17113#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17113#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:58,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {17113#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17114#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:58,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {17114#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17114#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:58,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {17114#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17115#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:58,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {17115#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17115#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:58,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {17115#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17116#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:58,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {17116#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17116#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:58,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {17116#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17117#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:58,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {17117#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17117#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:58,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {17117#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17118#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:58,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {17118#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17118#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:58,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {17118#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17119#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:58,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {17119#(<= main_~a~0 12)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17119#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:58,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {17119#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17120#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:58,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {17120#(<= main_~a~0 13)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17120#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:58,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {17120#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17121#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:58,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {17121#(<= main_~a~0 14)} assume !(~a~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {17106#false} havoc ~i~0;~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 46: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 47: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 49: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,512 INFO L273 TraceCheckUtils]: 50: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 60: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 65: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 80: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 82: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 86: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,518 INFO L273 TraceCheckUtils]: 87: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 88: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 89: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 90: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 91: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 92: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,519 INFO L273 TraceCheckUtils]: 93: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 94: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 95: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 96: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 97: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 98: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 99: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,520 INFO L273 TraceCheckUtils]: 100: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 101: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 102: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 103: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 104: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 105: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,521 INFO L273 TraceCheckUtils]: 106: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 107: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 108: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 109: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 110: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 111: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,522 INFO L273 TraceCheckUtils]: 112: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 113: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 114: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 115: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 116: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 117: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,523 INFO L273 TraceCheckUtils]: 118: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 119: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 120: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 121: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 122: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 123: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,524 INFO L273 TraceCheckUtils]: 124: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 125: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 126: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 127: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 128: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 129: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 130: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,525 INFO L273 TraceCheckUtils]: 131: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 132: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 133: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 134: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 135: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 136: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,526 INFO L273 TraceCheckUtils]: 137: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 138: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 139: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 140: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 141: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 142: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,527 INFO L273 TraceCheckUtils]: 143: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 144: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 145: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 146: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 147: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 148: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,528 INFO L273 TraceCheckUtils]: 149: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 150: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 151: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 152: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 153: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 154: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,529 INFO L273 TraceCheckUtils]: 155: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 156: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 157: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 158: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 159: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 160: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 161: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,530 INFO L273 TraceCheckUtils]: 162: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 163: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 164: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 165: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 166: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 167: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,531 INFO L273 TraceCheckUtils]: 168: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 169: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 170: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 171: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 172: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 173: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:58,532 INFO L273 TraceCheckUtils]: 174: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 175: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 176: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 177: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 178: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 179: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,533 INFO L273 TraceCheckUtils]: 180: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 181: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 182: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 183: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 184: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 185: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,534 INFO L273 TraceCheckUtils]: 186: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 187: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 188: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 189: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 190: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 191: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 192: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:58,535 INFO L273 TraceCheckUtils]: 193: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 194: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 195: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 196: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 197: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 198: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,536 INFO L273 TraceCheckUtils]: 199: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 200: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 201: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 202: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 203: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 204: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,537 INFO L273 TraceCheckUtils]: 205: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 206: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 207: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 208: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 209: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 210: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,538 INFO L273 TraceCheckUtils]: 211: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L273 TraceCheckUtils]: 212: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L273 TraceCheckUtils]: 213: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L273 TraceCheckUtils]: 214: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L273 TraceCheckUtils]: 215: Hoare triple {17106#false} havoc ~x~0;~x~0 := 0; {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L273 TraceCheckUtils]: 216: Hoare triple {17106#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {17106#false} is VALID [2018-11-23 11:54:58,539 INFO L256 TraceCheckUtils]: 217: Hoare triple {17106#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {17106#false} is VALID [2018-11-23 11:54:58,540 INFO L273 TraceCheckUtils]: 218: Hoare triple {17106#false} ~cond := #in~cond; {17106#false} is VALID [2018-11-23 11:54:58,540 INFO L273 TraceCheckUtils]: 219: Hoare triple {17106#false} assume 0 == ~cond; {17106#false} is VALID [2018-11-23 11:54:58,540 INFO L273 TraceCheckUtils]: 220: Hoare triple {17106#false} assume !false; {17106#false} is VALID [2018-11-23 11:54:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:54:58,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:58,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:58,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {17105#true} call ULTIMATE.init(); {17105#true} is VALID [2018-11-23 11:54:59,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {17105#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17105#true} is VALID [2018-11-23 11:54:59,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {17105#true} assume true; {17105#true} is VALID [2018-11-23 11:54:59,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17105#true} {17105#true} #175#return; {17105#true} is VALID [2018-11-23 11:54:59,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {17105#true} call #t~ret24 := main(); {17105#true} is VALID [2018-11-23 11:54:59,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {17105#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17140#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:59,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {17140#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17140#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:59,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {17140#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17108#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:59,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {17108#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17108#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:59,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {17108#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17109#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:59,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {17109#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17109#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:59,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {17109#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:59,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {17110#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17110#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:59,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {17110#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17111#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:59,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {17111#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17111#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:59,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {17111#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17112#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:59,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {17112#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17112#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:59,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {17112#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17113#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:59,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {17113#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17113#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:59,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {17113#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17114#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:59,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {17114#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17114#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:59,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {17114#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17115#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:59,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {17115#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17115#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:59,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {17115#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17116#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:59,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {17116#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17116#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:59,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {17116#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17117#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:59,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {17117#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17117#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:59,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {17117#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17118#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:59,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {17118#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17118#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:59,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {17118#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17119#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:59,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {17119#(<= main_~a~0 12)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17119#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:59,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {17119#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17120#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:59,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {17120#(<= main_~a~0 13)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17120#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:59,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {17120#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17121#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:59,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {17121#(<= main_~a~0 14)} assume !(~a~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {17106#false} havoc ~i~0;~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 40: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 44: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 45: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 49: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 50: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 52: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 53: Hoare triple {17106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 54: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,025 INFO L273 TraceCheckUtils]: 55: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 56: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 57: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 58: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 63: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 64: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 65: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 66: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 67: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 68: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 69: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 71: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 72: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 73: Hoare triple {17106#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17106#false} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 74: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 75: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 76: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 77: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 80: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 81: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 82: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 83: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 84: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 85: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 86: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 87: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 88: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 89: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 90: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 91: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 92: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 93: Hoare triple {17106#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 94: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 95: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 96: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 97: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 98: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 100: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 101: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 102: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 103: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 104: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 105: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 106: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 107: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 108: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 109: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 110: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 111: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,031 INFO L273 TraceCheckUtils]: 112: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 113: Hoare triple {17106#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 114: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 115: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 116: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 117: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 118: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 119: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 120: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,032 INFO L273 TraceCheckUtils]: 121: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 122: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 123: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 124: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 125: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 126: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 127: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 128: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 129: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,033 INFO L273 TraceCheckUtils]: 130: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 131: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 132: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 133: Hoare triple {17106#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 134: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 135: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 136: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 137: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 138: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 139: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 140: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 141: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 142: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 143: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 144: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 145: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 146: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 147: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 148: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,035 INFO L273 TraceCheckUtils]: 149: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 150: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 151: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 152: Hoare triple {17106#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 153: Hoare triple {17106#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 154: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 155: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 156: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 157: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 158: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 159: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 160: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 161: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 162: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 163: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 164: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 165: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 166: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 167: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 168: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 169: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 170: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 171: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 172: Hoare triple {17106#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; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 173: Hoare triple {17106#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 174: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 175: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 176: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 177: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,038 INFO L273 TraceCheckUtils]: 178: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 179: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 180: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 181: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 182: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 183: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 184: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 185: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 186: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,039 INFO L273 TraceCheckUtils]: 187: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 188: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 189: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 190: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 191: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 192: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 193: Hoare triple {17106#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 194: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 195: Hoare triple {17106#false} ~i~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 196: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 197: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 198: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 199: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 200: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 201: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 202: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 203: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 204: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 205: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 206: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 207: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 208: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 209: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 210: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 211: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 212: Hoare triple {17106#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 213: Hoare triple {17106#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 214: Hoare triple {17106#false} assume !(~i~0 < 100000); {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 215: Hoare triple {17106#false} havoc ~x~0;~x~0 := 0; {17106#false} is VALID [2018-11-23 11:54:59,042 INFO L273 TraceCheckUtils]: 216: Hoare triple {17106#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {17106#false} is VALID [2018-11-23 11:54:59,043 INFO L256 TraceCheckUtils]: 217: Hoare triple {17106#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {17106#false} is VALID [2018-11-23 11:54:59,043 INFO L273 TraceCheckUtils]: 218: Hoare triple {17106#false} ~cond := #in~cond; {17106#false} is VALID [2018-11-23 11:54:59,043 INFO L273 TraceCheckUtils]: 219: Hoare triple {17106#false} assume 0 == ~cond; {17106#false} is VALID [2018-11-23 11:54:59,043 INFO L273 TraceCheckUtils]: 220: Hoare triple {17106#false} assume !false; {17106#false} is VALID [2018-11-23 11:54:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:54:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:54:59,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 221 [2018-11-23 11:54:59,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:59,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:54:59,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:54:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:54:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:54:59,161 INFO L87 Difference]: Start difference. First operand 226 states and 236 transitions. Second operand 18 states. [2018-11-23 11:54:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,512 INFO L93 Difference]: Finished difference Result 420 states and 440 transitions. [2018-11-23 11:54:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:54:59,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 221 [2018-11-23 11:54:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:54:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 11:54:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:54:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 11:54:59,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 134 transitions. [2018-11-23 11:54:59,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,636 INFO L225 Difference]: With dead ends: 420 [2018-11-23 11:54:59,637 INFO L226 Difference]: Without dead ends: 229 [2018-11-23 11:54:59,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:54:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-23 11:54:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-11-23 11:54:59,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:59,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 228 states. [2018-11-23 11:54:59,754 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 228 states. [2018-11-23 11:54:59,754 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 228 states. [2018-11-23 11:54:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,758 INFO L93 Difference]: Finished difference Result 229 states and 239 transitions. [2018-11-23 11:54:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 239 transitions. [2018-11-23 11:54:59,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,759 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 229 states. [2018-11-23 11:54:59,759 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 229 states. [2018-11-23 11:54:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,763 INFO L93 Difference]: Finished difference Result 229 states and 239 transitions. [2018-11-23 11:54:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 239 transitions. [2018-11-23 11:54:59,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:59,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-23 11:54:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 238 transitions. [2018-11-23 11:54:59,768 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 238 transitions. Word has length 221 [2018-11-23 11:54:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:59,768 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 238 transitions. [2018-11-23 11:54:59,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:54:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 238 transitions. [2018-11-23 11:54:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-23 11:54:59,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:59,770 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-11-23 11:54:59,771 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:59,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -910175546, now seen corresponding path program 15 times [2018-11-23 11:54:59,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:59,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {19210#true} call ULTIMATE.init(); {19210#true} is VALID [2018-11-23 11:55:01,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {19210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19210#true} is VALID [2018-11-23 11:55:01,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {19210#true} assume true; {19210#true} is VALID [2018-11-23 11:55:01,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19210#true} {19210#true} #175#return; {19210#true} is VALID [2018-11-23 11:55:01,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {19210#true} call #t~ret24 := main(); {19210#true} is VALID [2018-11-23 11:55:01,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {19210#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);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19212#(= main_~a~0 0)} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {19212#(= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19212#(= main_~a~0 0)} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {19212#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19213#(<= main_~a~0 1)} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {19213#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19213#(<= main_~a~0 1)} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {19213#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19214#(<= main_~a~0 2)} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {19214#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19214#(<= main_~a~0 2)} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {19214#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19215#(<= main_~a~0 3)} is VALID [2018-11-23 11:55:01,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {19215#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19215#(<= main_~a~0 3)} is VALID [2018-11-23 11:55:01,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {19215#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19216#(<= main_~a~0 4)} is VALID [2018-11-23 11:55:01,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {19216#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19216#(<= main_~a~0 4)} is VALID [2018-11-23 11:55:01,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {19216#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19217#(<= main_~a~0 5)} is VALID [2018-11-23 11:55:01,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {19217#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19217#(<= main_~a~0 5)} is VALID [2018-11-23 11:55:01,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {19217#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19218#(<= main_~a~0 6)} is VALID [2018-11-23 11:55:01,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {19218#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19218#(<= main_~a~0 6)} is VALID [2018-11-23 11:55:01,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {19218#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19219#(<= main_~a~0 7)} is VALID [2018-11-23 11:55:01,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {19219#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19219#(<= main_~a~0 7)} is VALID [2018-11-23 11:55:01,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {19219#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19220#(<= main_~a~0 8)} is VALID [2018-11-23 11:55:01,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {19220#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19220#(<= main_~a~0 8)} is VALID [2018-11-23 11:55:01,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {19220#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19221#(<= main_~a~0 9)} is VALID [2018-11-23 11:55:01,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {19221#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19221#(<= main_~a~0 9)} is VALID [2018-11-23 11:55:01,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {19221#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19222#(<= main_~a~0 10)} is VALID [2018-11-23 11:55:01,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {19222#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19222#(<= main_~a~0 10)} is VALID [2018-11-23 11:55:01,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {19222#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19223#(<= main_~a~0 11)} is VALID [2018-11-23 11:55:01,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {19223#(<= 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19223#(<= main_~a~0 11)} is VALID [2018-11-23 11:55:01,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {19223#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19224#(<= main_~a~0 12)} is VALID [2018-11-23 11:55:01,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {19224#(<= main_~a~0 12)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19224#(<= main_~a~0 12)} is VALID [2018-11-23 11:55:01,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {19224#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19225#(<= main_~a~0 13)} is VALID [2018-11-23 11:55:01,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {19225#(<= main_~a~0 13)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19225#(<= main_~a~0 13)} is VALID [2018-11-23 11:55:01,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {19225#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19226#(<= main_~a~0 14)} is VALID [2018-11-23 11:55:01,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {19226#(<= main_~a~0 14)} 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, ~#a9~0.base, ~#a9~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19226#(<= main_~a~0 14)} is VALID [2018-11-23 11:55:01,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {19226#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19227#(<= main_~a~0 15)} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {19227#(<= main_~a~0 15)} assume !(~a~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {19211#false} havoc ~i~0;~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 53: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 55: Hoare triple {19211#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19211#false} is VALID [2018-11-23 11:55:01,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 57: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 62: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 63: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,148 INFO L273 TraceCheckUtils]: 64: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 65: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 66: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 70: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,149 INFO L273 TraceCheckUtils]: 73: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 74: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 75: Hoare triple {19211#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 76: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 77: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 78: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 79: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 81: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 82: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,150 INFO L273 TraceCheckUtils]: 83: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 84: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 85: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 86: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 87: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 88: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 89: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 90: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,151 INFO L273 TraceCheckUtils]: 91: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 92: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 93: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 94: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 95: Hoare triple {19211#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 96: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,152 INFO L273 TraceCheckUtils]: 97: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 98: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 99: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 100: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 101: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 102: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 103: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,153 INFO L273 TraceCheckUtils]: 104: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 105: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 106: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 107: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 108: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 109: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,154 INFO L273 TraceCheckUtils]: 110: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 111: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 112: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 113: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 114: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 115: Hoare triple {19211#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 116: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,155 INFO L273 TraceCheckUtils]: 117: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 118: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 119: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 120: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 121: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 122: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 123: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 124: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 125: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,156 INFO L273 TraceCheckUtils]: 126: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 127: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 128: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 129: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 130: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 131: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 132: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 133: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 134: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 135: Hoare triple {19211#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19211#false} is VALID [2018-11-23 11:55:01,157 INFO L273 TraceCheckUtils]: 136: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 137: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 138: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 139: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 140: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 141: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 142: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 143: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 144: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,158 INFO L273 TraceCheckUtils]: 145: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 146: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 147: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 148: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 149: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 150: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 151: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 152: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 153: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,159 INFO L273 TraceCheckUtils]: 154: Hoare triple {19211#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, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 155: Hoare triple {19211#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 156: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 157: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 158: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 159: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 160: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 161: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 162: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 163: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,160 INFO L273 TraceCheckUtils]: 164: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 165: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 166: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 167: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 168: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 169: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 170: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 171: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 172: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,161 INFO L273 TraceCheckUtils]: 173: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 174: Hoare triple {19211#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; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 175: Hoare triple {19211#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 176: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 177: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 178: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 179: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 180: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 181: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 182: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,162 INFO L273 TraceCheckUtils]: 183: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 184: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 185: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 186: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 187: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 188: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 189: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 190: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 191: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,163 INFO L273 TraceCheckUtils]: 192: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 193: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 194: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 195: Hoare triple {19211#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 196: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 197: Hoare triple {19211#false} ~i~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 198: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 199: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 200: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 201: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,164 INFO L273 TraceCheckUtils]: 202: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 203: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 204: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 205: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 206: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 207: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 208: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 209: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 210: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,165 INFO L273 TraceCheckUtils]: 211: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 212: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 213: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 214: Hoare triple {19211#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem20; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 215: Hoare triple {19211#false} #t~post19 := ~i~0;~i~0 := 1 + #t~post19;havoc #t~post19; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 216: Hoare triple {19211#false} assume !(~i~0 < 100000); {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 217: Hoare triple {19211#false} havoc ~x~0;~x~0 := 0; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 218: Hoare triple {19211#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L256 TraceCheckUtils]: 219: Hoare triple {19211#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 220: Hoare triple {19211#false} ~cond := #in~cond; {19211#false} is VALID [2018-11-23 11:55:01,166 INFO L273 TraceCheckUtils]: 221: Hoare triple {19211#false} assume 0 == ~cond; {19211#false} is VALID [2018-11-23 11:55:01,167 INFO L273 TraceCheckUtils]: 222: Hoare triple {19211#false} assume !false; {19211#false} is VALID [2018-11-23 11:55:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:55:01,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:01,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2