java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:55:09,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:55:09,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:55:09,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:55:09,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:55:09,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:55:09,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:55:09,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:55:09,798 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:55:09,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:55:09,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:55:09,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:55:09,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:55:09,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:55:09,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:55:09,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:55:09,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:55:09,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:55:09,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:55:09,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:55:09,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:55:09,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:55:09,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:55:09,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:55:09,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:55:09,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:55:09,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:55:09,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:55:09,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:55:09,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:55:09,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:55:09,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:55:09,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:55:09,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:55:09,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:55:09,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:55:09,827 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-14 16:55:09,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:55:09,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:55:09,861 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:55:09,861 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:55:09,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:55:09,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:55:09,863 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:55:09,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:55:09,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:55:09,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:55:09,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:55:09,865 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:55:09,865 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:55:09,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:55:09,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:55:09,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:55:09,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:55:09,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:55:09,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:55:09,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:55:09,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:55:09,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:55:09,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:09,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:55:09,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:55:09,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:55:09,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:55:09,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:55:09,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:55:09,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:55:09,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:55:09,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:55:09,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:55:09,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:55:09,963 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:55:09,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i [2018-11-14 16:55:10,035 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61c4e277/9a33e770931f4da6877b025f636fced2/FLAGed1cdd08d [2018-11-14 16:55:10,582 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:55:10,583 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i [2018-11-14 16:55:10,596 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61c4e277/9a33e770931f4da6877b025f636fced2/FLAGed1cdd08d [2018-11-14 16:55:10,622 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61c4e277/9a33e770931f4da6877b025f636fced2 [2018-11-14 16:55:10,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:55:10,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:55:10,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:10,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:55:10,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:55:10,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:10" (1/1) ... [2018-11-14 16:55:10,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce9ff51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:10, skipping insertion in model container [2018-11-14 16:55:10,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:10" (1/1) ... [2018-11-14 16:55:10,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:55:10,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:55:10,937 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:10,942 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:55:10,982 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:11,019 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:55:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11 WrapperNode [2018-11-14 16:55:11,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:11,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:55:11,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:55:11,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:55:11,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... [2018-11-14 16:55:11,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:55:11,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:55:11,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:55:11,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:55:11,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:55:11,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:55:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:55:11,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:55:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:55:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:55:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:55:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:55:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:55:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:55:12,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:55:12,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:12 BoogieIcfgContainer [2018-11-14 16:55:12,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:55:12,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:55:12,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:55:12,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:55:12,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:55:10" (1/3) ... [2018-11-14 16:55:12,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6057000e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:12, skipping insertion in model container [2018-11-14 16:55:12,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:11" (2/3) ... [2018-11-14 16:55:12,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6057000e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:12, skipping insertion in model container [2018-11-14 16:55:12,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:12" (3/3) ... [2018-11-14 16:55:12,490 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy9_true-unreach-call_ground.i [2018-11-14 16:55:12,502 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:55:12,514 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:55:12,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:55:12,580 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:55:12,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:55:12,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:55:12,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:55:12,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:55:12,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:55:12,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:55:12,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:55:12,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:55:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-11-14 16:55:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:55:12,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:12,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:12,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:12,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2102163447, now seen corresponding path program 1 times [2018-11-14 16:55:12,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:12,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {65#true} is VALID [2018-11-14 16:55:12,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65#true} is VALID [2018-11-14 16:55:12,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2018-11-14 16:55:12,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #186#return; {65#true} is VALID [2018-11-14 16:55:12,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {65#true} call #t~ret23 := main(); {65#true} is VALID [2018-11-14 16:55:12,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {65#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; {65#true} is VALID [2018-11-14 16:55:12,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#true} assume !true; {66#false} is VALID [2018-11-14 16:55:12,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {66#false} havoc ~i~0;~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 16:55:12,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {66#false} havoc ~x~0;~x~0 := 0; {66#false} is VALID [2018-11-14 16:55:12,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-14 16:55:12,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {66#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {66#false} is VALID [2018-11-14 16:55:12,838 INFO L256 TraceCheckUtils]: 28: Hoare triple {66#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {66#false} is VALID [2018-11-14 16:55:12,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {66#false} ~cond := #in~cond; {66#false} is VALID [2018-11-14 16:55:12,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {66#false} assume ~cond == 0; {66#false} is VALID [2018-11-14 16:55:12,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {66#false} assume !false; {66#false} is VALID [2018-11-14 16:55:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:12,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:12,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:55:12,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:55:12,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:12,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:55:13,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:13,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:55:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:55:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:55:13,063 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-11-14 16:55:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:13,267 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2018-11-14 16:55:13,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:55:13,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:55:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-14 16:55:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-14 16:55:13,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 158 transitions. [2018-11-14 16:55:14,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:14,061 INFO L225 Difference]: With dead ends: 115 [2018-11-14 16:55:14,061 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 16:55:14,066 INFO L604 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-14 16:55:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 16:55:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-14 16:55:14,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:14,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-14 16:55:14,322 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 16:55:14,323 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 16:55:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:14,330 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 16:55:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 16:55:14,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:14,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:14,332 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 16:55:14,332 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 16:55:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:14,338 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 16:55:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 16:55:14,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:14,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:14,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:14,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 16:55:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-14 16:55:14,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 32 [2018-11-14 16:55:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:14,347 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-14 16:55:14,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:55:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 16:55:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:55:14,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:14,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:14,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:14,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash -55002290, now seen corresponding path program 1 times [2018-11-14 16:55:14,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:14,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:14,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:14,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-14 16:55:14,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {401#true} is VALID [2018-11-14 16:55:14,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-14 16:55:14,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #186#return; {401#true} is VALID [2018-11-14 16:55:14,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret23 := main(); {401#true} is VALID [2018-11-14 16:55:14,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#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; {403#(= main_~a~0 0)} is VALID [2018-11-14 16:55:14,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(= main_~a~0 0)} assume true; {403#(= main_~a~0 0)} is VALID [2018-11-14 16:55:14,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(= main_~a~0 0)} assume !(~a~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {402#false} havoc ~i~0;~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 16:55:14,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {402#false} havoc ~x~0;~x~0 := 0; {402#false} is VALID [2018-11-14 16:55:14,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 16:55:14,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {402#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {402#false} is VALID [2018-11-14 16:55:14,503 INFO L256 TraceCheckUtils]: 38: Hoare triple {402#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {402#false} is VALID [2018-11-14 16:55:14,507 INFO L273 TraceCheckUtils]: 39: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-14 16:55:14,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {402#false} assume ~cond == 0; {402#false} is VALID [2018-11-14 16:55:14,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-14 16:55:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:14,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:14,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:55:14,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 16:55:14,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:14,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:55:14,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:14,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:55:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:55:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:55:14,629 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 3 states. [2018-11-14 16:55:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:14,882 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2018-11-14 16:55:14,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:55:14,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 16:55:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:55:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:55:14,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 16:55:15,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:15,201 INFO L225 Difference]: With dead ends: 108 [2018-11-14 16:55:15,201 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:55:15,205 INFO L604 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-14 16:55:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:55:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 16:55:15,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:15,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 16:55:15,258 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 16:55:15,259 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 16:55:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:15,262 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 16:55:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-14 16:55:15,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:15,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:15,264 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 16:55:15,264 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 16:55:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:15,268 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 16:55:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-14 16:55:15,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:15,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:15,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:15,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:55:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-14 16:55:15,273 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 42 [2018-11-14 16:55:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-14 16:55:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:55:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-14 16:55:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:55:15,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:15,278 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-14 16:55:15,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:15,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1427077725, now seen corresponding path program 1 times [2018-11-14 16:55:15,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:15,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:15,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:15,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-14 16:55:15,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {741#true} is VALID [2018-11-14 16:55:15,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 16:55:15,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {741#true} {741#true} #186#return; {741#true} is VALID [2018-11-14 16:55:15,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {741#true} call #t~ret23 := main(); {741#true} is VALID [2018-11-14 16:55:15,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#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; {741#true} is VALID [2018-11-14 16:55:15,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 16:55:15,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {741#true} is VALID [2018-11-14 16:55:15,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {741#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {741#true} is VALID [2018-11-14 16:55:15,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 16:55:15,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {741#true} assume !(~a~0 < 100000); {741#true} is VALID [2018-11-14 16:55:15,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {741#true} havoc ~i~0;~i~0 := 0; {743#(= main_~i~0 0)} is VALID [2018-11-14 16:55:15,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {743#(= main_~i~0 0)} assume true; {743#(= main_~i~0 0)} is VALID [2018-11-14 16:55:15,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {743#(= main_~i~0 0)} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 16:55:15,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {742#false} havoc ~x~0;~x~0 := 0; {742#false} is VALID [2018-11-14 16:55:15,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 16:55:15,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {742#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {742#false} is VALID [2018-11-14 16:55:15,405 INFO L256 TraceCheckUtils]: 41: Hoare triple {742#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {742#false} is VALID [2018-11-14 16:55:15,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {742#false} ~cond := #in~cond; {742#false} is VALID [2018-11-14 16:55:15,405 INFO L273 TraceCheckUtils]: 43: Hoare triple {742#false} assume ~cond == 0; {742#false} is VALID [2018-11-14 16:55:15,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-14 16:55:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:55:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:55:15,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-14 16:55:15,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:15,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:55:15,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:55:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:55:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:55:15,542 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 3 states. [2018-11-14 16:55:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:15,819 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-14 16:55:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:55:15,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-14 16:55:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 16:55:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 16:55:15,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-14 16:55:16,046 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-14 16:55:16,051 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:55:16,051 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 16:55:16,052 INFO L604 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-14 16:55:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 16:55:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-11-14 16:55:16,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:16,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 77 states. [2018-11-14 16:55:16,191 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 77 states. [2018-11-14 16:55:16,191 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 77 states. [2018-11-14 16:55:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:16,195 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 16:55:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-14 16:55:16,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:16,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:16,197 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 86 states. [2018-11-14 16:55:16,197 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 86 states. [2018-11-14 16:55:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:16,202 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 16:55:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-14 16:55:16,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:16,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:16,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:16,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:55:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-14 16:55:16,207 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 45 [2018-11-14 16:55:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:16,208 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-14 16:55:16,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:55:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-14 16:55:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 16:55:16,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:16,211 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:16,211 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:16,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash 870895647, now seen corresponding path program 1 times [2018-11-14 16:55:16,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:16,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:16,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-14 16:55:16,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-14 16:55:16,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-14 16:55:16,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #186#return; {1190#true} is VALID [2018-11-14 16:55:16,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret23 := main(); {1190#true} is VALID [2018-11-14 16:55:16,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#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; {1192#(= main_~a~0 0)} is VALID [2018-11-14 16:55:16,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {1192#(= main_~a~0 0)} assume true; {1192#(= main_~a~0 0)} is VALID [2018-11-14 16:55:16,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {1192#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1192#(= main_~a~0 0)} is VALID [2018-11-14 16:55:16,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {1192#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:16,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {1193#(<= main_~a~0 1)} assume true; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:16,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {1193#(<= main_~a~0 1)} assume !(~a~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} havoc ~i~0;~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1191#false} is VALID [2018-11-14 16:55:16,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1191#false} is VALID [2018-11-14 16:55:16,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1191#false} is VALID [2018-11-14 16:55:16,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {1191#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1191#false} is VALID [2018-11-14 16:55:16,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1191#false} is VALID [2018-11-14 16:55:16,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1191#false} is VALID [2018-11-14 16:55:16,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1191#false} is VALID [2018-11-14 16:55:16,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {1191#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1191#false} is VALID [2018-11-14 16:55:16,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,394 INFO L273 TraceCheckUtils]: 37: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {1191#false} is VALID [2018-11-14 16:55:16,395 INFO L273 TraceCheckUtils]: 38: Hoare triple {1191#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {1191#false} is VALID [2018-11-14 16:55:16,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,395 INFO L273 TraceCheckUtils]: 40: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,396 INFO L273 TraceCheckUtils]: 41: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,396 INFO L273 TraceCheckUtils]: 43: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {1191#false} is VALID [2018-11-14 16:55:16,397 INFO L273 TraceCheckUtils]: 44: Hoare triple {1191#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1191#false} is VALID [2018-11-14 16:55:16,397 INFO L273 TraceCheckUtils]: 45: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,397 INFO L273 TraceCheckUtils]: 46: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,398 INFO L273 TraceCheckUtils]: 47: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,398 INFO L273 TraceCheckUtils]: 48: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,398 INFO L273 TraceCheckUtils]: 49: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {1191#false} is VALID [2018-11-14 16:55:16,398 INFO L273 TraceCheckUtils]: 50: Hoare triple {1191#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1191#false} is VALID [2018-11-14 16:55:16,399 INFO L273 TraceCheckUtils]: 51: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,399 INFO L273 TraceCheckUtils]: 52: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,399 INFO L273 TraceCheckUtils]: 53: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,400 INFO L273 TraceCheckUtils]: 55: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {1191#false} is VALID [2018-11-14 16:55:16,400 INFO L273 TraceCheckUtils]: 56: Hoare triple {1191#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {1191#false} is VALID [2018-11-14 16:55:16,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,401 INFO L273 TraceCheckUtils]: 59: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,401 INFO L273 TraceCheckUtils]: 60: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,402 INFO L273 TraceCheckUtils]: 61: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {1191#false} is VALID [2018-11-14 16:55:16,402 INFO L273 TraceCheckUtils]: 62: Hoare triple {1191#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {1191#false} is VALID [2018-11-14 16:55:16,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {1191#false} havoc ~x~0;~x~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {1191#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1191#false} is VALID [2018-11-14 16:55:16,404 INFO L256 TraceCheckUtils]: 68: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1191#false} is VALID [2018-11-14 16:55:16,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-14 16:55:16,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {1191#false} assume ~cond == 0; {1191#false} is VALID [2018-11-14 16:55:16,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-14 16:55:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:55:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:16,418 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-14 16:55:16,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:16,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:16,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-14 16:55:16,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-14 16:55:16,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-14 16:55:16,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #186#return; {1190#true} is VALID [2018-11-14 16:55:16,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret23 := main(); {1190#true} is VALID [2018-11-14 16:55:16,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#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; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:16,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {1212#(<= main_~a~0 0)} assume true; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:16,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {1212#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:16,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {1212#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:16,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {1193#(<= main_~a~0 1)} assume true; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:16,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {1193#(<= main_~a~0 1)} assume !(~a~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} havoc ~i~0;~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1191#false} is VALID [2018-11-14 16:55:16,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1191#false} is VALID [2018-11-14 16:55:16,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1191#false} is VALID [2018-11-14 16:55:16,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {1191#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1191#false} is VALID [2018-11-14 16:55:16,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1191#false} is VALID [2018-11-14 16:55:16,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1191#false} is VALID [2018-11-14 16:55:16,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1191#false} is VALID [2018-11-14 16:55:16,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {1191#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1191#false} is VALID [2018-11-14 16:55:16,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,898 INFO L273 TraceCheckUtils]: 37: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {1191#false} is VALID [2018-11-14 16:55:16,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {1191#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {1191#false} is VALID [2018-11-14 16:55:16,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {1191#false} is VALID [2018-11-14 16:55:16,900 INFO L273 TraceCheckUtils]: 44: Hoare triple {1191#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1191#false} is VALID [2018-11-14 16:55:16,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,901 INFO L273 TraceCheckUtils]: 46: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {1191#false} is VALID [2018-11-14 16:55:16,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {1191#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1191#false} is VALID [2018-11-14 16:55:16,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,902 INFO L273 TraceCheckUtils]: 53: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {1191#false} is VALID [2018-11-14 16:55:16,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {1191#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {1191#false} is VALID [2018-11-14 16:55:16,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,903 INFO L273 TraceCheckUtils]: 58: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {1191#false} is VALID [2018-11-14 16:55:16,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {1191#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {1191#false} is VALID [2018-11-14 16:55:16,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,905 INFO L273 TraceCheckUtils]: 64: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 16:55:16,905 INFO L273 TraceCheckUtils]: 65: Hoare triple {1191#false} havoc ~x~0;~x~0 := 0; {1191#false} is VALID [2018-11-14 16:55:16,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 16:55:16,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {1191#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1191#false} is VALID [2018-11-14 16:55:16,906 INFO L256 TraceCheckUtils]: 68: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1191#false} is VALID [2018-11-14 16:55:16,906 INFO L273 TraceCheckUtils]: 69: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-14 16:55:16,906 INFO L273 TraceCheckUtils]: 70: Hoare triple {1191#false} assume ~cond == 0; {1191#false} is VALID [2018-11-14 16:55:16,907 INFO L273 TraceCheckUtils]: 71: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-14 16:55:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:55:16,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:16,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:55:16,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-14 16:55:16,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:16,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:55:17,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:17,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:55:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:55:17,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:55:17,093 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2018-11-14 16:55:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:17,464 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2018-11-14 16:55:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:55:17,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-14 16:55:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2018-11-14 16:55:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2018-11-14 16:55:17,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2018-11-14 16:55:17,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:17,676 INFO L225 Difference]: With dead ends: 147 [2018-11-14 16:55:17,677 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 16:55:17,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-14 16:55:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 16:55:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-14 16:55:17,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:17,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-14 16:55:17,722 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-14 16:55:17,723 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-14 16:55:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:17,727 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-14 16:55:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-14 16:55:17,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:17,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-14 16:55:17,728 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-14 16:55:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:17,732 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-14 16:55:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-14 16:55:17,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:17,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:17,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:17,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:55:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-14 16:55:17,737 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 72 [2018-11-14 16:55:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:17,738 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-14 16:55:17,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:55:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-14 16:55:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 16:55:17,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:17,742 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:17,743 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:17,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash 120428468, now seen corresponding path program 2 times [2018-11-14 16:55:17,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:17,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:17,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:18,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2018-11-14 16:55:18,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1876#true} is VALID [2018-11-14 16:55:18,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #186#return; {1876#true} is VALID [2018-11-14 16:55:18,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret23 := main(); {1876#true} is VALID [2018-11-14 16:55:18,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {1876#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; {1878#(= main_~a~0 0)} is VALID [2018-11-14 16:55:18,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {1878#(= main_~a~0 0)} assume true; {1878#(= main_~a~0 0)} is VALID [2018-11-14 16:55:18,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1878#(= main_~a~0 0)} is VALID [2018-11-14 16:55:18,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1878#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:18,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {1879#(<= main_~a~0 1)} assume true; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:18,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1879#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:18,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {1879#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1880#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:18,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {1880#(<= main_~a~0 2)} assume true; {1880#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:18,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {1880#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {1877#false} havoc ~i~0;~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1877#false} is VALID [2018-11-14 16:55:18,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {1877#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1877#false} is VALID [2018-11-14 16:55:18,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1877#false} is VALID [2018-11-14 16:55:18,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {1877#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1877#false} is VALID [2018-11-14 16:55:18,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1877#false} is VALID [2018-11-14 16:55:18,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {1877#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1877#false} is VALID [2018-11-14 16:55:18,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,092 INFO L273 TraceCheckUtils]: 31: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,092 INFO L273 TraceCheckUtils]: 32: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1877#false} is VALID [2018-11-14 16:55:18,093 INFO L273 TraceCheckUtils]: 35: Hoare triple {1877#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1877#false} is VALID [2018-11-14 16:55:18,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {1877#false} is VALID [2018-11-14 16:55:18,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {1877#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {1877#false} is VALID [2018-11-14 16:55:18,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {1877#false} is VALID [2018-11-14 16:55:18,096 INFO L273 TraceCheckUtils]: 47: Hoare triple {1877#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1877#false} is VALID [2018-11-14 16:55:18,096 INFO L273 TraceCheckUtils]: 48: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,096 INFO L273 TraceCheckUtils]: 49: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,097 INFO L273 TraceCheckUtils]: 51: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {1877#false} is VALID [2018-11-14 16:55:18,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {1877#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1877#false} is VALID [2018-11-14 16:55:18,097 INFO L273 TraceCheckUtils]: 54: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,098 INFO L273 TraceCheckUtils]: 56: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,098 INFO L273 TraceCheckUtils]: 57: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,098 INFO L273 TraceCheckUtils]: 58: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {1877#false} is VALID [2018-11-14 16:55:18,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {1877#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {1877#false} is VALID [2018-11-14 16:55:18,099 INFO L273 TraceCheckUtils]: 60: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,099 INFO L273 TraceCheckUtils]: 62: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,099 INFO L273 TraceCheckUtils]: 63: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,099 INFO L273 TraceCheckUtils]: 64: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {1877#false} is VALID [2018-11-14 16:55:18,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {1877#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {1877#false} is VALID [2018-11-14 16:55:18,100 INFO L273 TraceCheckUtils]: 66: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,100 INFO L273 TraceCheckUtils]: 67: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,100 INFO L273 TraceCheckUtils]: 68: Hoare triple {1877#false} havoc ~x~0;~x~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,101 INFO L273 TraceCheckUtils]: 70: Hoare triple {1877#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1877#false} is VALID [2018-11-14 16:55:18,101 INFO L256 TraceCheckUtils]: 71: Hoare triple {1877#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1877#false} is VALID [2018-11-14 16:55:18,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2018-11-14 16:55:18,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {1877#false} assume ~cond == 0; {1877#false} is VALID [2018-11-14 16:55:18,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2018-11-14 16:55:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:55:18,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:18,107 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-14 16:55:18,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:18,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:18,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:18,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:18,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2018-11-14 16:55:18,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1876#true} is VALID [2018-11-14 16:55:18,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #186#return; {1876#true} is VALID [2018-11-14 16:55:18,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret23 := main(); {1876#true} is VALID [2018-11-14 16:55:18,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1876#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; {1876#true} is VALID [2018-11-14 16:55:18,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {1876#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1876#true} is VALID [2018-11-14 16:55:18,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {1876#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {1876#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {1876#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1876#true} assume !(~a~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {1876#true} havoc ~i~0;~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1876#true} is VALID [2018-11-14 16:55:18,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {1876#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1876#true} is VALID [2018-11-14 16:55:18,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1876#true} is VALID [2018-11-14 16:55:18,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {1876#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1876#true} is VALID [2018-11-14 16:55:18,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1876#true} is VALID [2018-11-14 16:55:18,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {1876#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1876#true} is VALID [2018-11-14 16:55:18,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1876#true} is VALID [2018-11-14 16:55:18,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {1876#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1876#true} is VALID [2018-11-14 16:55:18,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {1876#true} is VALID [2018-11-14 16:55:18,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {1876#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {1876#true} is VALID [2018-11-14 16:55:18,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {1876#true} is VALID [2018-11-14 16:55:18,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {1876#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1876#true} is VALID [2018-11-14 16:55:18,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {1876#true} is VALID [2018-11-14 16:55:18,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {1876#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1876#true} is VALID [2018-11-14 16:55:18,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 16:55:18,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,413 INFO L273 TraceCheckUtils]: 58: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {1876#true} is VALID [2018-11-14 16:55:18,413 INFO L273 TraceCheckUtils]: 59: Hoare triple {1876#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {1876#true} is VALID [2018-11-14 16:55:18,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 16:55:18,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 16:55:18,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {1876#true} ~i~0 := 0; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:18,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {2070#(<= main_~i~0 0)} assume true; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:18,416 INFO L273 TraceCheckUtils]: 64: Hoare triple {2070#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:18,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {2070#(<= main_~i~0 0)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {2080#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:18,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {2080#(<= main_~i~0 1)} assume true; {2080#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:18,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {2080#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 16:55:18,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {1877#false} havoc ~x~0;~x~0 := 0; {1877#false} is VALID [2018-11-14 16:55:18,420 INFO L273 TraceCheckUtils]: 69: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 16:55:18,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {1877#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1877#false} is VALID [2018-11-14 16:55:18,420 INFO L256 TraceCheckUtils]: 71: Hoare triple {1877#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1877#false} is VALID [2018-11-14 16:55:18,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2018-11-14 16:55:18,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {1877#false} assume ~cond == 0; {1877#false} is VALID [2018-11-14 16:55:18,421 INFO L273 TraceCheckUtils]: 74: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2018-11-14 16:55:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 16:55:18,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:18,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 16:55:18,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-14 16:55:18,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:18,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:55:18,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:18,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:55:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:55:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:55:18,611 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 7 states. [2018-11-14 16:55:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:19,483 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2018-11-14 16:55:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:55:19,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-14 16:55:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2018-11-14 16:55:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2018-11-14 16:55:19,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 197 transitions. [2018-11-14 16:55:19,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:19,900 INFO L225 Difference]: With dead ends: 186 [2018-11-14 16:55:19,900 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 16:55:19,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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-14 16:55:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 16:55:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2018-11-14 16:55:19,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:19,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 110 states. [2018-11-14 16:55:19,952 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 110 states. [2018-11-14 16:55:19,952 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 110 states. [2018-11-14 16:55:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:19,957 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-11-14 16:55:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-11-14 16:55:19,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:19,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:19,958 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 120 states. [2018-11-14 16:55:19,958 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 120 states. [2018-11-14 16:55:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:19,962 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-11-14 16:55:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-11-14 16:55:19,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:19,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:19,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:19,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 16:55:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-11-14 16:55:19,968 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 75 [2018-11-14 16:55:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:19,969 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-14 16:55:19,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:55:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-11-14 16:55:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 16:55:19,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:19,971 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-11-14 16:55:19,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1353183933, now seen corresponding path program 3 times [2018-11-14 16:55:19,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:19,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:20,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2018-11-14 16:55:20,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2740#true} is VALID [2018-11-14 16:55:20,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #186#return; {2740#true} is VALID [2018-11-14 16:55:20,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret23 := main(); {2740#true} is VALID [2018-11-14 16:55:20,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {2740#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; {2742#(= main_~a~0 0)} is VALID [2018-11-14 16:55:20,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {2742#(= main_~a~0 0)} assume true; {2742#(= main_~a~0 0)} is VALID [2018-11-14 16:55:20,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {2742#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2742#(= main_~a~0 0)} is VALID [2018-11-14 16:55:20,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {2742#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:20,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {2743#(<= main_~a~0 1)} assume true; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:20,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {2743#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:20,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {2743#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:20,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {2744#(<= main_~a~0 2)} assume true; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:20,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {2744#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:20,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {2744#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2745#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:20,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {2745#(<= main_~a~0 3)} assume true; {2745#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:20,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {2745#(<= main_~a~0 3)} assume !(~a~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {2741#false} havoc ~i~0;~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {2741#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {2741#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {2741#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2741#false} is VALID [2018-11-14 16:55:20,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {2741#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2741#false} is VALID [2018-11-14 16:55:20,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2741#false} is VALID [2018-11-14 16:55:20,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {2741#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2741#false} is VALID [2018-11-14 16:55:20,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2741#false} is VALID [2018-11-14 16:55:20,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {2741#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 46: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2741#false} is VALID [2018-11-14 16:55:20,167 INFO L273 TraceCheckUtils]: 47: Hoare triple {2741#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {2741#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 51: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 52: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 53: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,168 INFO L273 TraceCheckUtils]: 54: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 56: Hoare triple {2741#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 57: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 58: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 59: Hoare triple {2741#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 60: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,169 INFO L273 TraceCheckUtils]: 61: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 62: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 63: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 64: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 65: Hoare triple {2741#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 66: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {2741#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2741#false} is VALID [2018-11-14 16:55:20,170 INFO L273 TraceCheckUtils]: 69: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 71: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {2741#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {2741#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 79: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {2741#false} is VALID [2018-11-14 16:55:20,172 INFO L273 TraceCheckUtils]: 83: Hoare triple {2741#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 84: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 86: Hoare triple {2741#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 88: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 89: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,173 INFO L273 TraceCheckUtils]: 90: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 91: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 92: Hoare triple {2741#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 94: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 95: Hoare triple {2741#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {2741#false} is VALID [2018-11-14 16:55:20,174 INFO L273 TraceCheckUtils]: 96: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,175 INFO L273 TraceCheckUtils]: 97: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,175 INFO L273 TraceCheckUtils]: 98: Hoare triple {2741#false} havoc ~x~0;~x~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,175 INFO L273 TraceCheckUtils]: 99: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,175 INFO L273 TraceCheckUtils]: 100: Hoare triple {2741#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {2741#false} is VALID [2018-11-14 16:55:20,176 INFO L256 TraceCheckUtils]: 101: Hoare triple {2741#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2741#false} is VALID [2018-11-14 16:55:20,176 INFO L273 TraceCheckUtils]: 102: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2018-11-14 16:55:20,176 INFO L273 TraceCheckUtils]: 103: Hoare triple {2741#false} assume ~cond == 0; {2741#false} is VALID [2018-11-14 16:55:20,176 INFO L273 TraceCheckUtils]: 104: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2018-11-14 16:55:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-14 16:55:20,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:20,187 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-14 16:55:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:55:20,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:55:20,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:20,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:20,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2018-11-14 16:55:20,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2740#true} is VALID [2018-11-14 16:55:20,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #186#return; {2740#true} is VALID [2018-11-14 16:55:20,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret23 := main(); {2740#true} is VALID [2018-11-14 16:55:20,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {2740#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; {2740#true} is VALID [2018-11-14 16:55:20,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2740#true} is VALID [2018-11-14 16:55:20,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 16:55:20,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2740#true} is VALID [2018-11-14 16:55:20,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 16:55:20,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {2740#true} assume !(~a~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {2740#true} havoc ~i~0;~i~0 := 0; {2740#true} is VALID [2018-11-14 16:55:20,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {2740#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {2740#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {2740#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {2740#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2740#true} is VALID [2018-11-14 16:55:20,548 INFO L273 TraceCheckUtils]: 33: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 37: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 38: Hoare triple {2740#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,549 INFO L273 TraceCheckUtils]: 40: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {2740#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 47: Hoare triple {2740#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2740#true} is VALID [2018-11-14 16:55:20,550 INFO L273 TraceCheckUtils]: 48: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {2740#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 52: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 53: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 54: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,551 INFO L273 TraceCheckUtils]: 55: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 56: Hoare triple {2740#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 57: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 58: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 59: Hoare triple {2740#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 60: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 16:55:20,552 INFO L273 TraceCheckUtils]: 61: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 16:55:20,553 INFO L273 TraceCheckUtils]: 62: Hoare triple {2740#true} ~i~0 := 0; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:20,553 INFO L273 TraceCheckUtils]: 63: Hoare triple {2935#(<= main_~i~0 0)} assume true; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:20,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {2935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:20,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {2935#(<= main_~i~0 0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:20,556 INFO L273 TraceCheckUtils]: 66: Hoare triple {2945#(<= main_~i~0 1)} assume true; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:20,556 INFO L273 TraceCheckUtils]: 67: Hoare triple {2945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:20,558 INFO L273 TraceCheckUtils]: 68: Hoare triple {2945#(<= main_~i~0 1)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2955#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:20,558 INFO L273 TraceCheckUtils]: 69: Hoare triple {2955#(<= main_~i~0 2)} assume true; {2955#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 70: Hoare triple {2955#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 71: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 72: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 73: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 74: Hoare triple {2741#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 75: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,560 INFO L273 TraceCheckUtils]: 76: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 77: Hoare triple {2741#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 78: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 79: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 80: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 81: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 82: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {2741#false} is VALID [2018-11-14 16:55:20,561 INFO L273 TraceCheckUtils]: 83: Hoare triple {2741#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {2741#false} is VALID [2018-11-14 16:55:20,562 INFO L273 TraceCheckUtils]: 84: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,562 INFO L273 TraceCheckUtils]: 85: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {2741#false} is VALID [2018-11-14 16:55:20,562 INFO L273 TraceCheckUtils]: 86: Hoare triple {2741#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {2741#false} is VALID [2018-11-14 16:55:20,562 INFO L273 TraceCheckUtils]: 87: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,562 INFO L273 TraceCheckUtils]: 88: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 89: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 90: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 91: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 92: Hoare triple {2741#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 93: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,563 INFO L273 TraceCheckUtils]: 94: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {2741#false} is VALID [2018-11-14 16:55:20,564 INFO L273 TraceCheckUtils]: 95: Hoare triple {2741#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {2741#false} is VALID [2018-11-14 16:55:20,564 INFO L273 TraceCheckUtils]: 96: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,564 INFO L273 TraceCheckUtils]: 97: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 16:55:20,564 INFO L273 TraceCheckUtils]: 98: Hoare triple {2741#false} havoc ~x~0;~x~0 := 0; {2741#false} is VALID [2018-11-14 16:55:20,564 INFO L273 TraceCheckUtils]: 99: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 16:55:20,565 INFO L273 TraceCheckUtils]: 100: Hoare triple {2741#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {2741#false} is VALID [2018-11-14 16:55:20,565 INFO L256 TraceCheckUtils]: 101: Hoare triple {2741#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2741#false} is VALID [2018-11-14 16:55:20,565 INFO L273 TraceCheckUtils]: 102: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2018-11-14 16:55:20,565 INFO L273 TraceCheckUtils]: 103: Hoare triple {2741#false} assume ~cond == 0; {2741#false} is VALID [2018-11-14 16:55:20,565 INFO L273 TraceCheckUtils]: 104: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2018-11-14 16:55:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-14 16:55:20,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 16:55:20,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-14 16:55:20,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:20,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:55:20,972 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-14 16:55:20,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:55:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:55:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:20,973 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 9 states. [2018-11-14 16:55:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:21,915 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2018-11-14 16:55:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:55:21,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-14 16:55:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2018-11-14 16:55:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2018-11-14 16:55:21,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 227 transitions. [2018-11-14 16:55:22,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:22,192 INFO L225 Difference]: With dead ends: 243 [2018-11-14 16:55:22,193 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 16:55:22,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 16:55:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2018-11-14 16:55:22,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:22,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 140 states. [2018-11-14 16:55:22,269 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 140 states. [2018-11-14 16:55:22,269 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 140 states. [2018-11-14 16:55:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:22,274 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-14 16:55:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-14 16:55:22,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:22,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:22,275 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 150 states. [2018-11-14 16:55:22,276 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 150 states. [2018-11-14 16:55:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:22,281 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-14 16:55:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-14 16:55:22,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:22,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:22,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:22,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 16:55:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-14 16:55:22,287 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 105 [2018-11-14 16:55:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:22,287 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-14 16:55:22,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:55:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-14 16:55:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-14 16:55:22,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:22,291 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2018-11-14 16:55:22,291 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:22,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -218217580, now seen corresponding path program 4 times [2018-11-14 16:55:22,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:22,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:22,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:22,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {3872#true} call ULTIMATE.init(); {3872#true} is VALID [2018-11-14 16:55:22,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {3872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3872#true} is VALID [2018-11-14 16:55:22,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {3872#true} assume true; {3872#true} is VALID [2018-11-14 16:55:22,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3872#true} {3872#true} #186#return; {3872#true} is VALID [2018-11-14 16:55:22,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {3872#true} call #t~ret23 := main(); {3872#true} is VALID [2018-11-14 16:55:22,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {3872#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; {3874#(= main_~a~0 0)} is VALID [2018-11-14 16:55:22,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {3874#(= main_~a~0 0)} assume true; {3874#(= main_~a~0 0)} is VALID [2018-11-14 16:55:22,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {3874#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3874#(= main_~a~0 0)} is VALID [2018-11-14 16:55:22,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {3874#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:22,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {3875#(<= main_~a~0 1)} assume true; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:22,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {3875#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:22,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:22,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~a~0 2)} assume true; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:22,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:22,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:22,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~a~0 3)} assume true; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:22,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {3877#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:22,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {3877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:22,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {3878#(<= main_~a~0 4)} assume true; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:22,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {3878#(<= main_~a~0 4)} assume !(~a~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {3873#false} havoc ~i~0;~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:22,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 27: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 28: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:22,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:22,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:22,738 INFO L273 TraceCheckUtils]: 47: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:22,738 INFO L273 TraceCheckUtils]: 48: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:22,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:22,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:22,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:22,740 INFO L273 TraceCheckUtils]: 60: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,740 INFO L273 TraceCheckUtils]: 61: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:22,740 INFO L273 TraceCheckUtils]: 62: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 63: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 64: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 65: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 66: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 69: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 70: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 72: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 73: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:22,742 INFO L273 TraceCheckUtils]: 74: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:22,743 INFO L273 TraceCheckUtils]: 75: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,743 INFO L273 TraceCheckUtils]: 76: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:22,743 INFO L273 TraceCheckUtils]: 77: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:22,743 INFO L273 TraceCheckUtils]: 78: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,743 INFO L273 TraceCheckUtils]: 79: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 80: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 81: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 82: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 83: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:22,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:22,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,745 INFO L273 TraceCheckUtils]: 88: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:22,745 INFO L273 TraceCheckUtils]: 89: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:22,745 INFO L273 TraceCheckUtils]: 90: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 92: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 93: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 94: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 95: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:22,746 INFO L273 TraceCheckUtils]: 96: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 97: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 99: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 100: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 101: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:22,747 INFO L273 TraceCheckUtils]: 102: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,748 INFO L273 TraceCheckUtils]: 103: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,748 INFO L273 TraceCheckUtils]: 105: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,748 INFO L273 TraceCheckUtils]: 106: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:22,748 INFO L273 TraceCheckUtils]: 107: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:22,749 INFO L273 TraceCheckUtils]: 108: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,749 INFO L273 TraceCheckUtils]: 109: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:22,749 INFO L273 TraceCheckUtils]: 110: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:22,749 INFO L273 TraceCheckUtils]: 111: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,749 INFO L273 TraceCheckUtils]: 112: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:22,750 INFO L273 TraceCheckUtils]: 113: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:22,750 INFO L273 TraceCheckUtils]: 114: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,750 INFO L273 TraceCheckUtils]: 115: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,750 INFO L273 TraceCheckUtils]: 116: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,750 INFO L273 TraceCheckUtils]: 117: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,751 INFO L273 TraceCheckUtils]: 118: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:22,751 INFO L273 TraceCheckUtils]: 119: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:22,751 INFO L273 TraceCheckUtils]: 120: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,751 INFO L273 TraceCheckUtils]: 121: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:22,752 INFO L273 TraceCheckUtils]: 122: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:22,752 INFO L273 TraceCheckUtils]: 123: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,752 INFO L273 TraceCheckUtils]: 124: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:22,752 INFO L273 TraceCheckUtils]: 125: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:22,752 INFO L273 TraceCheckUtils]: 126: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,753 INFO L273 TraceCheckUtils]: 127: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:22,753 INFO L273 TraceCheckUtils]: 128: Hoare triple {3873#false} havoc ~x~0;~x~0 := 0; {3873#false} is VALID [2018-11-14 16:55:22,753 INFO L273 TraceCheckUtils]: 129: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:22,753 INFO L273 TraceCheckUtils]: 130: Hoare triple {3873#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {3873#false} is VALID [2018-11-14 16:55:22,753 INFO L256 TraceCheckUtils]: 131: Hoare triple {3873#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {3873#false} is VALID [2018-11-14 16:55:22,754 INFO L273 TraceCheckUtils]: 132: Hoare triple {3873#false} ~cond := #in~cond; {3873#false} is VALID [2018-11-14 16:55:22,754 INFO L273 TraceCheckUtils]: 133: Hoare triple {3873#false} assume ~cond == 0; {3873#false} is VALID [2018-11-14 16:55:22,754 INFO L273 TraceCheckUtils]: 134: Hoare triple {3873#false} assume !false; {3873#false} is VALID [2018-11-14 16:55:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 16:55:22,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:22,768 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-14 16:55:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:22,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:22,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:22,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:23,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {3872#true} call ULTIMATE.init(); {3872#true} is VALID [2018-11-14 16:55:23,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {3872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3872#true} is VALID [2018-11-14 16:55:23,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {3872#true} assume true; {3872#true} is VALID [2018-11-14 16:55:23,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3872#true} {3872#true} #186#return; {3872#true} is VALID [2018-11-14 16:55:23,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {3872#true} call #t~ret23 := main(); {3872#true} is VALID [2018-11-14 16:55:23,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {3872#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; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:23,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {3897#(<= main_~a~0 0)} assume true; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:23,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {3897#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:23,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {3897#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:23,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {3875#(<= main_~a~0 1)} assume true; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:23,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {3875#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:23,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:23,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~a~0 2)} assume true; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:23,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:23,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:23,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~a~0 3)} assume true; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:23,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {3877#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:23,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {3877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:23,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {3878#(<= main_~a~0 4)} assume true; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:23,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {3878#(<= main_~a~0 4)} assume !(~a~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {3873#false} havoc ~i~0;~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:23,166 INFO L273 TraceCheckUtils]: 23: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:23,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:23,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:23,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3873#false} is VALID [2018-11-14 16:55:23,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {3873#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3873#false} is VALID [2018-11-14 16:55:23,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:23,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:23,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:23,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {3873#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:23,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:23,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:23,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:23,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3873#false} is VALID [2018-11-14 16:55:23,172 INFO L273 TraceCheckUtils]: 53: Hoare triple {3873#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3873#false} is VALID [2018-11-14 16:55:23,172 INFO L273 TraceCheckUtils]: 54: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 55: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 56: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 57: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:23,173 INFO L273 TraceCheckUtils]: 60: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:23,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:23,174 INFO L273 TraceCheckUtils]: 63: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,174 INFO L273 TraceCheckUtils]: 64: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3873#false} is VALID [2018-11-14 16:55:23,174 INFO L273 TraceCheckUtils]: 65: Hoare triple {3873#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 66: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 67: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 68: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 69: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 70: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:23,175 INFO L273 TraceCheckUtils]: 71: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 76: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {3873#false} is VALID [2018-11-14 16:55:23,176 INFO L273 TraceCheckUtils]: 77: Hoare triple {3873#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 79: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 81: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 82: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:23,177 INFO L273 TraceCheckUtils]: 83: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:23,178 INFO L273 TraceCheckUtils]: 84: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,178 INFO L273 TraceCheckUtils]: 85: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:23,178 INFO L273 TraceCheckUtils]: 86: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:23,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,178 INFO L273 TraceCheckUtils]: 88: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {3873#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 91: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 92: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 93: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,179 INFO L273 TraceCheckUtils]: 94: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:23,180 INFO L273 TraceCheckUtils]: 95: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:23,180 INFO L273 TraceCheckUtils]: 96: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,180 INFO L273 TraceCheckUtils]: 97: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:23,180 INFO L273 TraceCheckUtils]: 98: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:23,180 INFO L273 TraceCheckUtils]: 99: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 100: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 101: Hoare triple {3873#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 102: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 103: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 104: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,181 INFO L273 TraceCheckUtils]: 105: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 106: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 107: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 108: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 109: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 110: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:23,182 INFO L273 TraceCheckUtils]: 111: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 112: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 113: Hoare triple {3873#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 114: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 115: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 116: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,183 INFO L273 TraceCheckUtils]: 117: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,184 INFO L273 TraceCheckUtils]: 118: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:23,184 INFO L273 TraceCheckUtils]: 119: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:23,184 INFO L273 TraceCheckUtils]: 120: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,184 INFO L273 TraceCheckUtils]: 121: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:23,184 INFO L273 TraceCheckUtils]: 122: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 123: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 124: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 125: Hoare triple {3873#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 126: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 127: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 16:55:23,185 INFO L273 TraceCheckUtils]: 128: Hoare triple {3873#false} havoc ~x~0;~x~0 := 0; {3873#false} is VALID [2018-11-14 16:55:23,186 INFO L273 TraceCheckUtils]: 129: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 16:55:23,186 INFO L273 TraceCheckUtils]: 130: Hoare triple {3873#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {3873#false} is VALID [2018-11-14 16:55:23,186 INFO L256 TraceCheckUtils]: 131: Hoare triple {3873#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {3873#false} is VALID [2018-11-14 16:55:23,186 INFO L273 TraceCheckUtils]: 132: Hoare triple {3873#false} ~cond := #in~cond; {3873#false} is VALID [2018-11-14 16:55:23,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {3873#false} assume ~cond == 0; {3873#false} is VALID [2018-11-14 16:55:23,187 INFO L273 TraceCheckUtils]: 134: Hoare triple {3873#false} assume !false; {3873#false} is VALID [2018-11-14 16:55:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 16:55:23,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:23,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:55:23,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-11-14 16:55:23,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:23,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:55:23,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:23,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:55:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:55:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:55:23,451 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 8 states. [2018-11-14 16:55:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:24,047 INFO L93 Difference]: Finished difference Result 264 states and 284 transitions. [2018-11-14 16:55:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:55:24,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-11-14 16:55:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-11-14 16:55:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-11-14 16:55:24,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 140 transitions. [2018-11-14 16:55:24,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:24,763 INFO L225 Difference]: With dead ends: 264 [2018-11-14 16:55:24,763 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 16:55:24,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 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-14 16:55:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 16:55:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-14 16:55:25,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:25,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 143 states. [2018-11-14 16:55:25,235 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 143 states. [2018-11-14 16:55:25,235 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 143 states. [2018-11-14 16:55:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:25,240 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 16:55:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-14 16:55:25,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:25,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:25,241 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 144 states. [2018-11-14 16:55:25,241 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 144 states. [2018-11-14 16:55:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:25,245 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 16:55:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-14 16:55:25,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:25,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:25,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:25,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 16:55:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-14 16:55:25,250 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 135 [2018-11-14 16:55:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:25,250 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-14 16:55:25,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:55:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-14 16:55:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-14 16:55:25,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:25,252 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2018-11-14 16:55:25,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:25,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1078731425, now seen corresponding path program 5 times [2018-11-14 16:55:25,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:25,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:25,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:25,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {5116#true} call ULTIMATE.init(); {5116#true} is VALID [2018-11-14 16:55:25,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {5116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5116#true} is VALID [2018-11-14 16:55:25,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:25,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5116#true} {5116#true} #186#return; {5116#true} is VALID [2018-11-14 16:55:25,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {5116#true} call #t~ret23 := main(); {5116#true} is VALID [2018-11-14 16:55:25,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {5116#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; {5118#(= main_~a~0 0)} is VALID [2018-11-14 16:55:25,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {5118#(= main_~a~0 0)} assume true; {5118#(= main_~a~0 0)} is VALID [2018-11-14 16:55:25,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {5118#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5118#(= main_~a~0 0)} is VALID [2018-11-14 16:55:25,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {5118#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:25,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {5119#(<= main_~a~0 1)} assume true; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:25,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {5119#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:25,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {5119#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:25,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {5120#(<= main_~a~0 2)} assume true; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:25,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {5120#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:25,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {5120#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:25,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {5121#(<= main_~a~0 3)} assume true; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:25,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {5121#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:25,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:25,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {5122#(<= main_~a~0 4)} assume true; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:25,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {5122#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:25,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {5122#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5123#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:25,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {5123#(<= main_~a~0 5)} assume true; {5123#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:25,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {5123#(<= main_~a~0 5)} assume !(~a~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {5117#false} havoc ~i~0;~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5117#false} is VALID [2018-11-14 16:55:25,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {5117#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5117#false} is VALID [2018-11-14 16:55:25,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5117#false} is VALID [2018-11-14 16:55:25,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {5117#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5117#false} is VALID [2018-11-14 16:55:25,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5117#false} is VALID [2018-11-14 16:55:25,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {5117#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5117#false} is VALID [2018-11-14 16:55:25,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5117#false} is VALID [2018-11-14 16:55:25,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {5117#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5117#false} is VALID [2018-11-14 16:55:25,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5117#false} is VALID [2018-11-14 16:55:25,443 INFO L273 TraceCheckUtils]: 41: Hoare triple {5117#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5117#false} is VALID [2018-11-14 16:55:25,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5117#false} is VALID [2018-11-14 16:55:25,444 INFO L273 TraceCheckUtils]: 44: Hoare triple {5117#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5117#false} is VALID [2018-11-14 16:55:25,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 50: Hoare triple {5117#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 51: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,445 INFO L273 TraceCheckUtils]: 52: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 53: Hoare triple {5117#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 55: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 56: Hoare triple {5117#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 57: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 58: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 59: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 60: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,446 INFO L273 TraceCheckUtils]: 61: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 62: Hoare triple {5117#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {5117#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 67: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 68: Hoare triple {5117#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5117#false} is VALID [2018-11-14 16:55:25,447 INFO L273 TraceCheckUtils]: 69: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 70: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 71: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 72: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 73: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 74: Hoare triple {5117#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 75: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,448 INFO L273 TraceCheckUtils]: 76: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5117#false} is VALID [2018-11-14 16:55:25,449 INFO L273 TraceCheckUtils]: 77: Hoare triple {5117#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5117#false} is VALID [2018-11-14 16:55:25,449 INFO L273 TraceCheckUtils]: 78: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,449 INFO L273 TraceCheckUtils]: 79: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5117#false} is VALID [2018-11-14 16:55:25,449 INFO L273 TraceCheckUtils]: 80: Hoare triple {5117#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5117#false} is VALID [2018-11-14 16:55:25,450 INFO L273 TraceCheckUtils]: 81: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,450 INFO L273 TraceCheckUtils]: 82: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,450 INFO L273 TraceCheckUtils]: 83: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,450 INFO L273 TraceCheckUtils]: 84: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,450 INFO L273 TraceCheckUtils]: 85: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5117#false} is VALID [2018-11-14 16:55:25,451 INFO L273 TraceCheckUtils]: 86: Hoare triple {5117#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5117#false} is VALID [2018-11-14 16:55:25,451 INFO L273 TraceCheckUtils]: 87: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,451 INFO L273 TraceCheckUtils]: 88: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5117#false} is VALID [2018-11-14 16:55:25,451 INFO L273 TraceCheckUtils]: 89: Hoare triple {5117#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5117#false} is VALID [2018-11-14 16:55:25,451 INFO L273 TraceCheckUtils]: 90: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,452 INFO L273 TraceCheckUtils]: 91: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5117#false} is VALID [2018-11-14 16:55:25,452 INFO L273 TraceCheckUtils]: 92: Hoare triple {5117#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5117#false} is VALID [2018-11-14 16:55:25,452 INFO L273 TraceCheckUtils]: 93: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,452 INFO L273 TraceCheckUtils]: 94: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 95: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 96: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 97: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 98: Hoare triple {5117#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 99: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,453 INFO L273 TraceCheckUtils]: 100: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5117#false} is VALID [2018-11-14 16:55:25,454 INFO L273 TraceCheckUtils]: 101: Hoare triple {5117#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5117#false} is VALID [2018-11-14 16:55:25,454 INFO L273 TraceCheckUtils]: 102: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,454 INFO L273 TraceCheckUtils]: 103: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5117#false} is VALID [2018-11-14 16:55:25,454 INFO L273 TraceCheckUtils]: 104: Hoare triple {5117#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5117#false} is VALID [2018-11-14 16:55:25,454 INFO L273 TraceCheckUtils]: 105: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 106: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 107: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 108: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 109: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 110: Hoare triple {5117#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5117#false} is VALID [2018-11-14 16:55:25,455 INFO L273 TraceCheckUtils]: 111: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 112: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 113: Hoare triple {5117#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 114: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 115: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 116: Hoare triple {5117#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5117#false} is VALID [2018-11-14 16:55:25,456 INFO L273 TraceCheckUtils]: 117: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 118: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 119: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 120: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 121: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 122: Hoare triple {5117#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5117#false} is VALID [2018-11-14 16:55:25,457 INFO L273 TraceCheckUtils]: 123: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 124: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 125: Hoare triple {5117#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 126: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 127: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 128: Hoare triple {5117#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5117#false} is VALID [2018-11-14 16:55:25,458 INFO L273 TraceCheckUtils]: 129: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L273 TraceCheckUtils]: 130: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L273 TraceCheckUtils]: 131: Hoare triple {5117#false} havoc ~x~0;~x~0 := 0; {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L273 TraceCheckUtils]: 132: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L273 TraceCheckUtils]: 133: Hoare triple {5117#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L256 TraceCheckUtils]: 134: Hoare triple {5117#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {5117#false} is VALID [2018-11-14 16:55:25,459 INFO L273 TraceCheckUtils]: 135: Hoare triple {5117#false} ~cond := #in~cond; {5117#false} is VALID [2018-11-14 16:55:25,460 INFO L273 TraceCheckUtils]: 136: Hoare triple {5117#false} assume ~cond == 0; {5117#false} is VALID [2018-11-14 16:55:25,460 INFO L273 TraceCheckUtils]: 137: Hoare triple {5117#false} assume !false; {5117#false} is VALID [2018-11-14 16:55:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 16:55:25,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:25,469 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-14 16:55:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:45,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:55:45,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:45,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {5116#true} call ULTIMATE.init(); {5116#true} is VALID [2018-11-14 16:55:45,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {5116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5116#true} is VALID [2018-11-14 16:55:45,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5116#true} {5116#true} #186#return; {5116#true} is VALID [2018-11-14 16:55:45,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {5116#true} call #t~ret23 := main(); {5116#true} is VALID [2018-11-14 16:55:45,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {5116#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; {5116#true} is VALID [2018-11-14 16:55:45,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5116#true} is VALID [2018-11-14 16:55:45,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 16:55:45,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5116#true} is VALID [2018-11-14 16:55:45,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 16:55:45,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5116#true} is VALID [2018-11-14 16:55:45,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 16:55:45,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5116#true} is VALID [2018-11-14 16:55:45,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 16:55:45,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5116#true} is VALID [2018-11-14 16:55:45,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 16:55:45,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {5116#true} assume !(~a~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {5116#true} havoc ~i~0;~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5116#true} is VALID [2018-11-14 16:55:45,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {5116#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5116#true} is VALID [2018-11-14 16:55:45,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5116#true} is VALID [2018-11-14 16:55:45,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {5116#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5116#true} is VALID [2018-11-14 16:55:45,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5116#true} is VALID [2018-11-14 16:55:45,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {5116#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5116#true} is VALID [2018-11-14 16:55:45,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,757 INFO L273 TraceCheckUtils]: 35: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,758 INFO L273 TraceCheckUtils]: 37: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5116#true} is VALID [2018-11-14 16:55:45,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {5116#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5116#true} is VALID [2018-11-14 16:55:45,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5116#true} is VALID [2018-11-14 16:55:45,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {5116#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5116#true} is VALID [2018-11-14 16:55:45,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5116#true} is VALID [2018-11-14 16:55:45,759 INFO L273 TraceCheckUtils]: 44: Hoare triple {5116#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5116#true} is VALID [2018-11-14 16:55:45,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,760 INFO L273 TraceCheckUtils]: 48: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5116#true} is VALID [2018-11-14 16:55:45,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {5116#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5116#true} is VALID [2018-11-14 16:55:45,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5116#true} is VALID [2018-11-14 16:55:45,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {5116#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5116#true} is VALID [2018-11-14 16:55:45,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,761 INFO L273 TraceCheckUtils]: 55: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5116#true} is VALID [2018-11-14 16:55:45,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {5116#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5116#true} is VALID [2018-11-14 16:55:45,762 INFO L273 TraceCheckUtils]: 57: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,762 INFO L273 TraceCheckUtils]: 59: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,762 INFO L273 TraceCheckUtils]: 60: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5116#true} is VALID [2018-11-14 16:55:45,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {5116#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5116#true} is VALID [2018-11-14 16:55:45,763 INFO L273 TraceCheckUtils]: 63: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,763 INFO L273 TraceCheckUtils]: 64: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5116#true} is VALID [2018-11-14 16:55:45,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {5116#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5116#true} is VALID [2018-11-14 16:55:45,764 INFO L273 TraceCheckUtils]: 66: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,764 INFO L273 TraceCheckUtils]: 67: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5116#true} is VALID [2018-11-14 16:55:45,764 INFO L273 TraceCheckUtils]: 68: Hoare triple {5116#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5116#true} is VALID [2018-11-14 16:55:45,764 INFO L273 TraceCheckUtils]: 69: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,765 INFO L273 TraceCheckUtils]: 71: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5116#true} is VALID [2018-11-14 16:55:45,765 INFO L273 TraceCheckUtils]: 74: Hoare triple {5116#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5116#true} is VALID [2018-11-14 16:55:45,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,766 INFO L273 TraceCheckUtils]: 76: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5116#true} is VALID [2018-11-14 16:55:45,766 INFO L273 TraceCheckUtils]: 77: Hoare triple {5116#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5116#true} is VALID [2018-11-14 16:55:45,766 INFO L273 TraceCheckUtils]: 78: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,766 INFO L273 TraceCheckUtils]: 79: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {5116#true} is VALID [2018-11-14 16:55:45,767 INFO L273 TraceCheckUtils]: 80: Hoare triple {5116#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5116#true} is VALID [2018-11-14 16:55:45,767 INFO L273 TraceCheckUtils]: 81: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,767 INFO L273 TraceCheckUtils]: 82: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,767 INFO L273 TraceCheckUtils]: 83: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,767 INFO L273 TraceCheckUtils]: 84: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,768 INFO L273 TraceCheckUtils]: 85: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5116#true} is VALID [2018-11-14 16:55:45,768 INFO L273 TraceCheckUtils]: 86: Hoare triple {5116#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5116#true} is VALID [2018-11-14 16:55:45,768 INFO L273 TraceCheckUtils]: 87: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,768 INFO L273 TraceCheckUtils]: 88: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5116#true} is VALID [2018-11-14 16:55:45,768 INFO L273 TraceCheckUtils]: 89: Hoare triple {5116#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5116#true} is VALID [2018-11-14 16:55:45,769 INFO L273 TraceCheckUtils]: 90: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,769 INFO L273 TraceCheckUtils]: 91: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {5116#true} is VALID [2018-11-14 16:55:45,769 INFO L273 TraceCheckUtils]: 92: Hoare triple {5116#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {5116#true} is VALID [2018-11-14 16:55:45,769 INFO L273 TraceCheckUtils]: 93: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,769 INFO L273 TraceCheckUtils]: 94: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,770 INFO L273 TraceCheckUtils]: 95: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,770 INFO L273 TraceCheckUtils]: 96: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,770 INFO L273 TraceCheckUtils]: 97: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5116#true} is VALID [2018-11-14 16:55:45,770 INFO L273 TraceCheckUtils]: 98: Hoare triple {5116#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5116#true} is VALID [2018-11-14 16:55:45,771 INFO L273 TraceCheckUtils]: 99: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,771 INFO L273 TraceCheckUtils]: 100: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5116#true} is VALID [2018-11-14 16:55:45,771 INFO L273 TraceCheckUtils]: 101: Hoare triple {5116#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5116#true} is VALID [2018-11-14 16:55:45,771 INFO L273 TraceCheckUtils]: 102: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,771 INFO L273 TraceCheckUtils]: 103: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {5116#true} is VALID [2018-11-14 16:55:45,772 INFO L273 TraceCheckUtils]: 104: Hoare triple {5116#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {5116#true} is VALID [2018-11-14 16:55:45,772 INFO L273 TraceCheckUtils]: 105: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,772 INFO L273 TraceCheckUtils]: 106: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,772 INFO L273 TraceCheckUtils]: 107: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 16:55:45,772 INFO L273 TraceCheckUtils]: 108: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,773 INFO L273 TraceCheckUtils]: 109: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5116#true} is VALID [2018-11-14 16:55:45,773 INFO L273 TraceCheckUtils]: 110: Hoare triple {5116#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5116#true} is VALID [2018-11-14 16:55:45,773 INFO L273 TraceCheckUtils]: 111: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,773 INFO L273 TraceCheckUtils]: 112: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5116#true} is VALID [2018-11-14 16:55:45,773 INFO L273 TraceCheckUtils]: 113: Hoare triple {5116#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5116#true} is VALID [2018-11-14 16:55:45,774 INFO L273 TraceCheckUtils]: 114: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,774 INFO L273 TraceCheckUtils]: 115: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {5116#true} is VALID [2018-11-14 16:55:45,774 INFO L273 TraceCheckUtils]: 116: Hoare triple {5116#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {5116#true} is VALID [2018-11-14 16:55:45,774 INFO L273 TraceCheckUtils]: 117: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 16:55:45,775 INFO L273 TraceCheckUtils]: 118: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 16:55:45,778 INFO L273 TraceCheckUtils]: 119: Hoare triple {5116#true} ~i~0 := 0; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,778 INFO L273 TraceCheckUtils]: 120: Hoare triple {5484#(<= main_~i~0 0)} assume true; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,779 INFO L273 TraceCheckUtils]: 121: Hoare triple {5484#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,779 INFO L273 TraceCheckUtils]: 122: Hoare triple {5484#(<= main_~i~0 0)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,782 INFO L273 TraceCheckUtils]: 123: Hoare triple {5494#(<= main_~i~0 1)} assume true; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,782 INFO L273 TraceCheckUtils]: 124: Hoare triple {5494#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,784 INFO L273 TraceCheckUtils]: 125: Hoare triple {5494#(<= main_~i~0 1)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,784 INFO L273 TraceCheckUtils]: 126: Hoare triple {5504#(<= main_~i~0 2)} assume true; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,786 INFO L273 TraceCheckUtils]: 127: Hoare triple {5504#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,786 INFO L273 TraceCheckUtils]: 128: Hoare triple {5504#(<= main_~i~0 2)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {5514#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,792 INFO L273 TraceCheckUtils]: 129: Hoare triple {5514#(<= main_~i~0 3)} assume true; {5514#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,794 INFO L273 TraceCheckUtils]: 130: Hoare triple {5514#(<= main_~i~0 3)} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 16:55:45,794 INFO L273 TraceCheckUtils]: 131: Hoare triple {5117#false} havoc ~x~0;~x~0 := 0; {5117#false} is VALID [2018-11-14 16:55:45,794 INFO L273 TraceCheckUtils]: 132: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 16:55:45,794 INFO L273 TraceCheckUtils]: 133: Hoare triple {5117#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {5117#false} is VALID [2018-11-14 16:55:45,794 INFO L256 TraceCheckUtils]: 134: Hoare triple {5117#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {5117#false} is VALID [2018-11-14 16:55:45,795 INFO L273 TraceCheckUtils]: 135: Hoare triple {5117#false} ~cond := #in~cond; {5117#false} is VALID [2018-11-14 16:55:45,795 INFO L273 TraceCheckUtils]: 136: Hoare triple {5117#false} assume ~cond == 0; {5117#false} is VALID [2018-11-14 16:55:45,795 INFO L273 TraceCheckUtils]: 137: Hoare triple {5117#false} assume !false; {5117#false} is VALID [2018-11-14 16:55:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:55:45,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:45,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 16:55:45,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 138 [2018-11-14 16:55:45,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:45,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:55:45,973 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-14 16:55:45,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:55:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:55:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:45,974 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 12 states. [2018-11-14 16:55:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,995 INFO L93 Difference]: Finished difference Result 303 states and 332 transitions. [2018-11-14 16:55:46,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:55:46,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 138 [2018-11-14 16:55:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2018-11-14 16:55:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2018-11-14 16:55:47,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 260 transitions. [2018-11-14 16:55:47,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:47,357 INFO L225 Difference]: With dead ends: 303 [2018-11-14 16:55:47,357 INFO L226 Difference]: Without dead ends: 183 [2018-11-14 16:55:47,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-14 16:55:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2018-11-14 16:55:47,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:47,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 173 states. [2018-11-14 16:55:47,450 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 173 states. [2018-11-14 16:55:47,450 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 173 states. [2018-11-14 16:55:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:47,457 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-11-14 16:55:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-11-14 16:55:47,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:47,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:47,458 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 183 states. [2018-11-14 16:55:47,458 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 183 states. [2018-11-14 16:55:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:47,464 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-11-14 16:55:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-11-14 16:55:47,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:47,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:47,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:47,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 16:55:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-11-14 16:55:47,471 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 138 [2018-11-14 16:55:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:47,472 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-11-14 16:55:47,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:55:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-11-14 16:55:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-14 16:55:47,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:47,474 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-11-14 16:55:47,474 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:47,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1275571858, now seen corresponding path program 6 times [2018-11-14 16:55:47,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:47,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:47,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:47,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {6540#true} call ULTIMATE.init(); {6540#true} is VALID [2018-11-14 16:55:47,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {6540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6540#true} is VALID [2018-11-14 16:55:47,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:47,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6540#true} {6540#true} #186#return; {6540#true} is VALID [2018-11-14 16:55:47,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {6540#true} call #t~ret23 := main(); {6540#true} is VALID [2018-11-14 16:55:47,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#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; {6542#(= main_~a~0 0)} is VALID [2018-11-14 16:55:47,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~a~0 0)} assume true; {6542#(= main_~a~0 0)} is VALID [2018-11-14 16:55:47,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {6542#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6542#(= main_~a~0 0)} is VALID [2018-11-14 16:55:47,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {6542#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:47,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {6543#(<= main_~a~0 1)} assume true; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:47,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {6543#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:47,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {6543#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:47,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {6544#(<= main_~a~0 2)} assume true; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:47,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {6544#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:47,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {6544#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:47,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {6545#(<= main_~a~0 3)} assume true; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:47,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {6545#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:47,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {6545#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:47,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {6546#(<= main_~a~0 4)} assume true; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:47,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {6546#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:47,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {6546#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:47,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {6547#(<= main_~a~0 5)} assume true; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:47,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {6547#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:47,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {6547#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6548#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:47,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {6548#(<= main_~a~0 6)} assume true; {6548#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:47,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {6548#(<= main_~a~0 6)} assume !(~a~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {6541#false} havoc ~i~0;~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6541#false} is VALID [2018-11-14 16:55:47,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {6541#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6541#false} is VALID [2018-11-14 16:55:47,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6541#false} is VALID [2018-11-14 16:55:47,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {6541#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6541#false} is VALID [2018-11-14 16:55:47,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6541#false} is VALID [2018-11-14 16:55:47,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {6541#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6541#false} is VALID [2018-11-14 16:55:47,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6541#false} is VALID [2018-11-14 16:55:47,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {6541#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6541#false} is VALID [2018-11-14 16:55:47,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {6541#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {6541#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6541#false} is VALID [2018-11-14 16:55:47,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {6541#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {6541#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 54: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {6541#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {6541#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 63: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 64: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 65: Hoare triple {6541#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 66: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,888 INFO L273 TraceCheckUtils]: 67: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 68: Hoare triple {6541#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 69: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 70: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 71: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 72: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 73: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 74: Hoare triple {6541#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6541#false} is VALID [2018-11-14 16:55:47,889 INFO L273 TraceCheckUtils]: 75: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 76: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 77: Hoare triple {6541#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 78: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 79: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 80: Hoare triple {6541#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 81: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 82: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6541#false} is VALID [2018-11-14 16:55:47,890 INFO L273 TraceCheckUtils]: 83: Hoare triple {6541#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 84: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 85: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 86: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 87: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 88: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 89: Hoare triple {6541#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 90: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 91: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6541#false} is VALID [2018-11-14 16:55:47,891 INFO L273 TraceCheckUtils]: 92: Hoare triple {6541#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 93: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 94: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 95: Hoare triple {6541#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 96: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 97: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 98: Hoare triple {6541#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 99: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,892 INFO L273 TraceCheckUtils]: 100: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 101: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 102: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 103: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 104: Hoare triple {6541#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 105: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 106: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 107: Hoare triple {6541#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6541#false} is VALID [2018-11-14 16:55:47,893 INFO L273 TraceCheckUtils]: 108: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 109: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 110: Hoare triple {6541#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 111: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 112: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 113: Hoare triple {6541#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 114: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 115: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 116: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,894 INFO L273 TraceCheckUtils]: 117: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 118: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 119: Hoare triple {6541#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 120: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 121: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 122: Hoare triple {6541#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 123: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 124: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6541#false} is VALID [2018-11-14 16:55:47,895 INFO L273 TraceCheckUtils]: 125: Hoare triple {6541#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 126: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 127: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 128: Hoare triple {6541#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 129: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 130: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 131: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 132: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,896 INFO L273 TraceCheckUtils]: 133: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 134: Hoare triple {6541#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 135: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 136: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 137: Hoare triple {6541#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 138: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 139: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 140: Hoare triple {6541#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6541#false} is VALID [2018-11-14 16:55:47,897 INFO L273 TraceCheckUtils]: 141: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,898 INFO L273 TraceCheckUtils]: 142: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6541#false} is VALID [2018-11-14 16:55:47,898 INFO L273 TraceCheckUtils]: 143: Hoare triple {6541#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6541#false} is VALID [2018-11-14 16:55:47,898 INFO L273 TraceCheckUtils]: 144: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,898 INFO L273 TraceCheckUtils]: 145: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,899 INFO L273 TraceCheckUtils]: 146: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,899 INFO L273 TraceCheckUtils]: 147: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,899 INFO L273 TraceCheckUtils]: 148: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:47,899 INFO L273 TraceCheckUtils]: 149: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 150: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 151: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 152: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 153: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 154: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 155: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 156: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,900 INFO L273 TraceCheckUtils]: 157: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 158: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 159: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 160: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 161: Hoare triple {6541#false} havoc ~x~0;~x~0 := 0; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 162: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 163: Hoare triple {6541#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L256 TraceCheckUtils]: 164: Hoare triple {6541#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 165: Hoare triple {6541#false} ~cond := #in~cond; {6541#false} is VALID [2018-11-14 16:55:47,901 INFO L273 TraceCheckUtils]: 166: Hoare triple {6541#false} assume ~cond == 0; {6541#false} is VALID [2018-11-14 16:55:47,902 INFO L273 TraceCheckUtils]: 167: Hoare triple {6541#false} assume !false; {6541#false} is VALID [2018-11-14 16:55:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-14 16:55:47,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:47,912 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-14 16:55:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:49,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:55:49,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:49,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:50,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {6540#true} call ULTIMATE.init(); {6540#true} is VALID [2018-11-14 16:55:50,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {6540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6540#true} is VALID [2018-11-14 16:55:50,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6540#true} {6540#true} #186#return; {6540#true} is VALID [2018-11-14 16:55:50,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {6540#true} call #t~ret23 := main(); {6540#true} is VALID [2018-11-14 16:55:50,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#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; {6540#true} is VALID [2018-11-14 16:55:50,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6540#true} is VALID [2018-11-14 16:55:50,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 16:55:50,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {6540#true} assume !(~a~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {6540#true} havoc ~i~0;~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {6540#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {6540#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {6540#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {6540#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 39: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6540#true} is VALID [2018-11-14 16:55:50,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {6540#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 45: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 46: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {6540#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6540#true} is VALID [2018-11-14 16:55:50,177 INFO L273 TraceCheckUtils]: 50: Hoare triple {6540#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 51: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 52: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 53: Hoare triple {6540#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 54: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 57: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 58: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 59: Hoare triple {6540#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 60: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 61: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6540#true} is VALID [2018-11-14 16:55:50,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {6540#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6540#true} is VALID [2018-11-14 16:55:50,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,180 INFO L273 TraceCheckUtils]: 64: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6540#true} is VALID [2018-11-14 16:55:50,180 INFO L273 TraceCheckUtils]: 65: Hoare triple {6540#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6540#true} is VALID [2018-11-14 16:55:50,180 INFO L273 TraceCheckUtils]: 66: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,190 INFO L273 TraceCheckUtils]: 67: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6753#(< main_~i~0 100000)} is VALID [2018-11-14 16:55:50,191 INFO L273 TraceCheckUtils]: 68: Hoare triple {6753#(< main_~i~0 100000)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6757#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:50,191 INFO L273 TraceCheckUtils]: 69: Hoare triple {6757#(<= main_~i~0 100000)} assume true; {6757#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 70: Hoare triple {6757#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 71: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 72: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 74: Hoare triple {6540#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 75: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 76: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6540#true} is VALID [2018-11-14 16:55:50,192 INFO L273 TraceCheckUtils]: 77: Hoare triple {6540#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 78: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 79: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 80: Hoare triple {6540#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 81: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 82: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 83: Hoare triple {6540#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 84: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 85: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,193 INFO L273 TraceCheckUtils]: 86: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 87: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 88: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 89: Hoare triple {6540#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 90: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 91: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 92: Hoare triple {6540#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 93: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,194 INFO L273 TraceCheckUtils]: 94: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 95: Hoare triple {6540#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 96: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 97: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 98: Hoare triple {6540#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 99: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 100: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 101: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 102: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,195 INFO L273 TraceCheckUtils]: 103: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 104: Hoare triple {6540#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 105: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 106: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 107: Hoare triple {6540#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 108: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 109: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 110: Hoare triple {6540#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6540#true} is VALID [2018-11-14 16:55:50,196 INFO L273 TraceCheckUtils]: 111: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 112: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 113: Hoare triple {6540#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 114: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 115: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 116: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 117: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 118: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 119: Hoare triple {6540#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6540#true} is VALID [2018-11-14 16:55:50,197 INFO L273 TraceCheckUtils]: 120: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 121: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 122: Hoare triple {6540#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 123: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 124: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 125: Hoare triple {6540#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 126: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 127: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {6540#true} is VALID [2018-11-14 16:55:50,198 INFO L273 TraceCheckUtils]: 128: Hoare triple {6540#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {6540#true} is VALID [2018-11-14 16:55:50,199 INFO L273 TraceCheckUtils]: 129: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 16:55:50,199 INFO L273 TraceCheckUtils]: 130: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 16:55:50,199 INFO L273 TraceCheckUtils]: 131: Hoare triple {6540#true} ~i~0 := 0; {6947#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:50,199 INFO L273 TraceCheckUtils]: 132: Hoare triple {6947#(<= main_~i~0 0)} assume true; {6947#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:50,201 INFO L273 TraceCheckUtils]: 133: Hoare triple {6947#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6947#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:50,201 INFO L273 TraceCheckUtils]: 134: Hoare triple {6947#(<= main_~i~0 0)} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6957#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:50,203 INFO L273 TraceCheckUtils]: 135: Hoare triple {6957#(<= main_~i~0 1)} assume true; {6957#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:50,203 INFO L273 TraceCheckUtils]: 136: Hoare triple {6957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6957#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:50,203 INFO L273 TraceCheckUtils]: 137: Hoare triple {6957#(<= main_~i~0 1)} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6967#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:50,204 INFO L273 TraceCheckUtils]: 138: Hoare triple {6967#(<= main_~i~0 2)} assume true; {6967#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:50,204 INFO L273 TraceCheckUtils]: 139: Hoare triple {6967#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6967#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:50,205 INFO L273 TraceCheckUtils]: 140: Hoare triple {6967#(<= main_~i~0 2)} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6977#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:50,205 INFO L273 TraceCheckUtils]: 141: Hoare triple {6977#(<= main_~i~0 3)} assume true; {6977#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:50,205 INFO L273 TraceCheckUtils]: 142: Hoare triple {6977#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {6977#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:50,206 INFO L273 TraceCheckUtils]: 143: Hoare triple {6977#(<= main_~i~0 3)} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {6987#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:50,206 INFO L273 TraceCheckUtils]: 144: Hoare triple {6987#(<= main_~i~0 4)} assume true; {6987#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:50,217 INFO L273 TraceCheckUtils]: 145: Hoare triple {6987#(<= main_~i~0 4)} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:50,217 INFO L273 TraceCheckUtils]: 146: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 147: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 148: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 149: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 150: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 151: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 152: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 153: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,218 INFO L273 TraceCheckUtils]: 154: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 155: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 156: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 157: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 158: Hoare triple {6541#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 159: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 160: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 16:55:50,219 INFO L273 TraceCheckUtils]: 161: Hoare triple {6541#false} havoc ~x~0;~x~0 := 0; {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L273 TraceCheckUtils]: 162: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L273 TraceCheckUtils]: 163: Hoare triple {6541#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L256 TraceCheckUtils]: 164: Hoare triple {6541#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L273 TraceCheckUtils]: 165: Hoare triple {6541#false} ~cond := #in~cond; {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L273 TraceCheckUtils]: 166: Hoare triple {6541#false} assume ~cond == 0; {6541#false} is VALID [2018-11-14 16:55:50,220 INFO L273 TraceCheckUtils]: 167: Hoare triple {6541#false} assume !false; {6541#false} is VALID [2018-11-14 16:55:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-14 16:55:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:55:50,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 168 [2018-11-14 16:55:50,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:50,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:55:50,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:50,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:55:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:55:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:55:50,378 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 16 states. [2018-11-14 16:55:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,121 INFO L93 Difference]: Finished difference Result 378 states and 416 transitions. [2018-11-14 16:55:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:55:53,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 168 [2018-11-14 16:55:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:55:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 317 transitions. [2018-11-14 16:55:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:55:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 317 transitions. [2018-11-14 16:55:53,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 317 transitions. [2018-11-14 16:55:53,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:53,563 INFO L225 Difference]: With dead ends: 378 [2018-11-14 16:55:53,564 INFO L226 Difference]: Without dead ends: 231 [2018-11-14 16:55:53,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:55:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-14 16:55:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-11-14 16:55:53,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:53,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand 230 states. [2018-11-14 16:55:53,724 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand 230 states. [2018-11-14 16:55:53,724 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 230 states. [2018-11-14 16:55:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,729 INFO L93 Difference]: Finished difference Result 231 states and 241 transitions. [2018-11-14 16:55:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 241 transitions. [2018-11-14 16:55:53,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:53,730 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 231 states. [2018-11-14 16:55:53,731 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 231 states. [2018-11-14 16:55:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,736 INFO L93 Difference]: Finished difference Result 231 states and 241 transitions. [2018-11-14 16:55:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 241 transitions. [2018-11-14 16:55:53,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:53,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:53,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:53,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-14 16:55:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 240 transitions. [2018-11-14 16:55:53,743 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 240 transitions. Word has length 168 [2018-11-14 16:55:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:53,744 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 240 transitions. [2018-11-14 16:55:53,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:55:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 240 transitions. [2018-11-14 16:55:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-14 16:55:53,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:53,747 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1] [2018-11-14 16:55:53,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:53,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash -771791741, now seen corresponding path program 7 times [2018-11-14 16:55:53,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:53,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {8333#true} call ULTIMATE.init(); {8333#true} is VALID [2018-11-14 16:55:54,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {8333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8333#true} is VALID [2018-11-14 16:55:54,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {8333#true} assume true; {8333#true} is VALID [2018-11-14 16:55:54,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8333#true} {8333#true} #186#return; {8333#true} is VALID [2018-11-14 16:55:54,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {8333#true} call #t~ret23 := main(); {8333#true} is VALID [2018-11-14 16:55:54,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {8333#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; {8335#(= main_~a~0 0)} is VALID [2018-11-14 16:55:54,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {8335#(= main_~a~0 0)} assume true; {8335#(= main_~a~0 0)} is VALID [2018-11-14 16:55:54,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {8335#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8335#(= main_~a~0 0)} is VALID [2018-11-14 16:55:54,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {8335#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {8336#(<= main_~a~0 1)} assume true; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {8336#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {8336#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {8337#(<= main_~a~0 2)} assume true; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {8337#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {8337#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {8338#(<= main_~a~0 3)} assume true; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {8338#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {8338#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {8339#(<= main_~a~0 4)} assume true; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {8339#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {8339#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {8340#(<= main_~a~0 5)} assume true; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {8340#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {8340#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {8341#(<= main_~a~0 6)} assume true; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {8341#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {8341#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8342#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:54,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {8342#(<= main_~a~0 7)} assume true; {8342#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:54,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {8342#(<= main_~a~0 7)} assume !(~a~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {8334#false} havoc ~i~0;~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,019 INFO L273 TraceCheckUtils]: 37: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 48: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 49: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 50: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 51: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,021 INFO L273 TraceCheckUtils]: 53: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 55: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 56: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 57: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 58: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 59: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 60: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 62: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 65: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 66: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 67: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 68: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 69: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 71: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 72: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 73: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 76: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 79: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 82: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 83: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 85: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 86: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,025 INFO L273 TraceCheckUtils]: 87: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 88: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 89: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 91: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 92: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 93: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 94: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,026 INFO L273 TraceCheckUtils]: 95: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 96: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 97: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 98: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 99: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 100: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 101: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 102: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 103: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,027 INFO L273 TraceCheckUtils]: 104: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 105: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 106: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 107: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 108: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 109: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 110: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 111: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,028 INFO L273 TraceCheckUtils]: 112: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 113: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 114: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 115: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 116: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 117: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 118: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 119: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 120: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,029 INFO L273 TraceCheckUtils]: 121: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 122: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 123: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 124: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 125: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 126: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 127: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 128: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,030 INFO L273 TraceCheckUtils]: 129: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 130: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 131: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 132: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 133: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 134: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 135: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 136: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,031 INFO L273 TraceCheckUtils]: 137: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 138: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 139: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 140: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 141: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 142: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 143: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 144: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 145: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,032 INFO L273 TraceCheckUtils]: 146: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 147: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 148: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 149: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 150: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 151: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 152: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 153: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,033 INFO L273 TraceCheckUtils]: 154: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 155: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 156: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 157: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 158: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 159: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 160: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 161: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,034 INFO L273 TraceCheckUtils]: 162: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 163: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 164: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 165: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 166: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 167: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 168: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 169: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 170: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,035 INFO L273 TraceCheckUtils]: 171: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 172: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 173: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 174: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 175: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 176: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 177: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 178: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,036 INFO L273 TraceCheckUtils]: 179: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 180: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 181: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 182: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 183: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 184: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 185: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 186: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 187: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,037 INFO L273 TraceCheckUtils]: 188: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 189: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 190: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 191: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 192: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 193: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 194: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 195: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,038 INFO L273 TraceCheckUtils]: 196: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 197: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 198: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 199: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 200: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 201: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 202: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 203: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 204: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,039 INFO L273 TraceCheckUtils]: 205: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 206: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 207: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 208: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 209: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 210: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 211: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 212: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,040 INFO L273 TraceCheckUtils]: 213: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 214: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 215: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 216: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 217: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 218: Hoare triple {8334#false} havoc ~x~0;~x~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 219: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L273 TraceCheckUtils]: 220: Hoare triple {8334#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {8334#false} is VALID [2018-11-14 16:55:54,041 INFO L256 TraceCheckUtils]: 221: Hoare triple {8334#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {8334#false} is VALID [2018-11-14 16:55:54,042 INFO L273 TraceCheckUtils]: 222: Hoare triple {8334#false} ~cond := #in~cond; {8334#false} is VALID [2018-11-14 16:55:54,042 INFO L273 TraceCheckUtils]: 223: Hoare triple {8334#false} assume ~cond == 0; {8334#false} is VALID [2018-11-14 16:55:54,042 INFO L273 TraceCheckUtils]: 224: Hoare triple {8334#false} assume !false; {8334#false} is VALID [2018-11-14 16:55:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-14 16:55:54,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:54,071 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-14 16:55:54,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:54,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {8333#true} call ULTIMATE.init(); {8333#true} is VALID [2018-11-14 16:55:54,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {8333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8333#true} is VALID [2018-11-14 16:55:54,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {8333#true} assume true; {8333#true} is VALID [2018-11-14 16:55:54,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8333#true} {8333#true} #186#return; {8333#true} is VALID [2018-11-14 16:55:54,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {8333#true} call #t~ret23 := main(); {8333#true} is VALID [2018-11-14 16:55:54,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {8333#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; {8361#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:54,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {8361#(<= main_~a~0 0)} assume true; {8361#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:54,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {8361#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8361#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:54,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {8361#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {8336#(<= main_~a~0 1)} assume true; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {8336#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8336#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:54,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {8336#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {8337#(<= main_~a~0 2)} assume true; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {8337#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8337#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:54,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {8337#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {8338#(<= main_~a~0 3)} assume true; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {8338#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8338#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:54,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {8338#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {8339#(<= main_~a~0 4)} assume true; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {8339#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8339#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:54,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {8339#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {8340#(<= main_~a~0 5)} assume true; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {8340#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8340#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:54,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {8340#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {8341#(<= main_~a~0 6)} assume true; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {8341#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {8341#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:54,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {8341#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8342#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:54,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {8342#(<= main_~a~0 7)} assume true; {8342#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:54,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {8342#(<= main_~a~0 7)} assume !(~a~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {8334#false} havoc ~i~0;~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {8334#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 48: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 49: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 50: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 51: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 55: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 56: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 58: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 60: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 67: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {8334#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 70: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,692 INFO L273 TraceCheckUtils]: 73: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 74: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 75: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 76: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,693 INFO L273 TraceCheckUtils]: 79: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 80: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 81: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 83: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {8334#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,695 INFO L273 TraceCheckUtils]: 92: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 93: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 94: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 95: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 96: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 98: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 100: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 101: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 102: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 103: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 104: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,697 INFO L273 TraceCheckUtils]: 105: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 106: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 107: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 108: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 109: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 110: Hoare triple {8334#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 111: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,698 INFO L273 TraceCheckUtils]: 112: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 113: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 114: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 115: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 116: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 117: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 118: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,699 INFO L273 TraceCheckUtils]: 119: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 120: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 121: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 122: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 123: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 124: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,700 INFO L273 TraceCheckUtils]: 125: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 126: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 127: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 128: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 129: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 130: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 131: Hoare triple {8334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8334#false} is VALID [2018-11-14 16:55:54,701 INFO L273 TraceCheckUtils]: 132: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 133: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 134: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 135: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 136: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 137: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,702 INFO L273 TraceCheckUtils]: 138: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 139: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 140: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 141: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 142: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 143: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 144: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,703 INFO L273 TraceCheckUtils]: 145: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 146: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 147: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 148: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 149: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 150: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,704 INFO L273 TraceCheckUtils]: 151: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 152: Hoare triple {8334#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 153: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 154: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 155: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 156: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 157: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,705 INFO L273 TraceCheckUtils]: 158: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 159: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 160: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 161: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 162: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 163: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 164: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,706 INFO L273 TraceCheckUtils]: 165: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 166: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 167: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 168: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 169: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 170: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,707 INFO L273 TraceCheckUtils]: 171: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 172: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 173: Hoare triple {8334#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 174: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 175: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 176: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 177: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,708 INFO L273 TraceCheckUtils]: 178: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 179: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 180: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 181: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 182: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 183: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,709 INFO L273 TraceCheckUtils]: 184: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 185: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 186: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 187: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 188: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 189: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 190: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,710 INFO L273 TraceCheckUtils]: 191: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 192: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 193: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 194: Hoare triple {8334#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 195: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 196: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 197: Hoare triple {8334#false} ~i~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,711 INFO L273 TraceCheckUtils]: 198: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 199: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 200: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 201: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 202: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 203: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,712 INFO L273 TraceCheckUtils]: 204: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 205: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 206: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 207: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 208: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 209: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 210: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,713 INFO L273 TraceCheckUtils]: 211: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 212: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 213: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 214: Hoare triple {8334#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 215: Hoare triple {8334#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 216: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,714 INFO L273 TraceCheckUtils]: 217: Hoare triple {8334#false} assume !(~i~0 < 100000); {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 218: Hoare triple {8334#false} havoc ~x~0;~x~0 := 0; {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 219: Hoare triple {8334#false} assume true; {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 220: Hoare triple {8334#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L256 TraceCheckUtils]: 221: Hoare triple {8334#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 222: Hoare triple {8334#false} ~cond := #in~cond; {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 223: Hoare triple {8334#false} assume ~cond == 0; {8334#false} is VALID [2018-11-14 16:55:54,715 INFO L273 TraceCheckUtils]: 224: Hoare triple {8334#false} assume !false; {8334#false} is VALID [2018-11-14 16:55:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-14 16:55:54,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:54,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:55:54,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-11-14 16:55:54,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:54,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:55:54,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:54,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:55:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:55:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:54,912 INFO L87 Difference]: Start difference. First operand 230 states and 240 transitions. Second operand 11 states. [2018-11-14 16:55:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,839 INFO L93 Difference]: Finished difference Result 435 states and 455 transitions. [2018-11-14 16:55:55,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:55:55,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-11-14 16:55:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2018-11-14 16:55:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2018-11-14 16:55:55,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 149 transitions. [2018-11-14 16:55:56,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:56,533 INFO L225 Difference]: With dead ends: 435 [2018-11-14 16:55:56,534 INFO L226 Difference]: Without dead ends: 234 [2018-11-14 16:55:56,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-14 16:55:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-11-14 16:55:56,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:56,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 233 states. [2018-11-14 16:55:56,608 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 233 states. [2018-11-14 16:55:56,608 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 233 states. [2018-11-14 16:55:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:56,614 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-11-14 16:55:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 244 transitions. [2018-11-14 16:55:56,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:56,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:56,615 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 234 states. [2018-11-14 16:55:56,615 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 234 states. [2018-11-14 16:55:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:56,621 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-11-14 16:55:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 244 transitions. [2018-11-14 16:55:56,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:56,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:56,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:56,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-14 16:55:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 243 transitions. [2018-11-14 16:55:56,628 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 243 transitions. Word has length 225 [2018-11-14 16:55:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:56,628 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 243 transitions. [2018-11-14 16:55:56,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:55:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 243 transitions. [2018-11-14 16:55:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-14 16:55:56,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:56,632 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1] [2018-11-14 16:55:56,632 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:56,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:56,633 INFO L82 PathProgramCache]: Analyzing trace with hash -571855218, now seen corresponding path program 8 times [2018-11-14 16:55:56,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:56,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:57,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10378#true} is VALID [2018-11-14 16:55:57,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {10378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10378#true} is VALID [2018-11-14 16:55:57,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2018-11-14 16:55:57,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #186#return; {10378#true} is VALID [2018-11-14 16:55:57,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret23 := main(); {10378#true} is VALID [2018-11-14 16:55:57,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {10378#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; {10380#(= main_~a~0 0)} is VALID [2018-11-14 16:55:57,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {10380#(= main_~a~0 0)} assume true; {10380#(= main_~a~0 0)} is VALID [2018-11-14 16:55:57,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {10380#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10380#(= main_~a~0 0)} is VALID [2018-11-14 16:55:57,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {10380#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {10381#(<= main_~a~0 1)} assume true; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {10381#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {10381#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {10382#(<= main_~a~0 2)} assume true; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {10382#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {10382#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {10383#(<= main_~a~0 3)} assume true; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {10383#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {10383#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {10384#(<= main_~a~0 4)} assume true; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {10384#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {10384#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {10385#(<= main_~a~0 5)} assume true; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {10385#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {10385#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {10386#(<= main_~a~0 6)} assume true; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {10386#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {10386#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {10387#(<= main_~a~0 7)} assume true; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {10387#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {10387#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10388#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:57,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {10388#(<= main_~a~0 8)} assume true; {10388#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:57,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {10388#(<= main_~a~0 8)} assume !(~a~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {10379#false} havoc ~i~0;~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,340 INFO L273 TraceCheckUtils]: 45: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 52: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 53: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 55: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 56: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,342 INFO L273 TraceCheckUtils]: 60: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 61: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 62: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 63: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 64: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 65: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 66: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 67: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 70: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 71: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 72: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 75: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 76: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,344 INFO L273 TraceCheckUtils]: 77: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 79: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 80: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 82: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 83: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 84: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 85: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,345 INFO L273 TraceCheckUtils]: 86: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 87: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 88: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 89: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 90: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 91: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 92: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 93: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 94: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,346 INFO L273 TraceCheckUtils]: 95: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 96: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 97: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 98: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 99: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 100: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 101: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 102: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 103: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 105: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 106: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 107: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 108: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 109: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 110: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 111: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 113: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 114: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 115: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 116: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 117: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 118: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 119: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 120: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,349 INFO L273 TraceCheckUtils]: 121: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 122: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 123: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 124: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 125: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 126: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 127: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 128: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 129: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,350 INFO L273 TraceCheckUtils]: 130: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 131: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 132: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 133: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 134: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 135: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 136: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 137: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,351 INFO L273 TraceCheckUtils]: 138: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 139: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 140: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 141: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 142: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 143: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 144: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 145: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 146: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,352 INFO L273 TraceCheckUtils]: 147: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 148: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 149: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 150: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 151: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 152: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 153: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 154: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 155: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,353 INFO L273 TraceCheckUtils]: 156: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 157: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 158: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 159: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 160: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 161: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 162: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 163: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,354 INFO L273 TraceCheckUtils]: 164: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 165: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 166: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 167: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 168: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 169: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 170: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 171: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 172: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,355 INFO L273 TraceCheckUtils]: 173: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 174: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 175: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 176: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 177: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 178: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 179: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 180: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 181: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,356 INFO L273 TraceCheckUtils]: 182: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 183: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 184: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 185: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 186: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 187: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 188: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 189: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 190: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,357 INFO L273 TraceCheckUtils]: 191: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 192: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 193: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 194: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 195: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 196: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 197: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 198: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,358 INFO L273 TraceCheckUtils]: 199: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 200: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 201: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 202: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 203: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 204: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 205: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 206: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 207: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,359 INFO L273 TraceCheckUtils]: 208: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 209: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 210: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 211: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 212: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 213: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 214: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 215: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 216: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,360 INFO L273 TraceCheckUtils]: 217: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 218: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 219: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 220: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 221: Hoare triple {10379#false} havoc ~x~0;~x~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 222: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 223: Hoare triple {10379#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L256 TraceCheckUtils]: 224: Hoare triple {10379#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {10379#false} is VALID [2018-11-14 16:55:57,361 INFO L273 TraceCheckUtils]: 225: Hoare triple {10379#false} ~cond := #in~cond; {10379#false} is VALID [2018-11-14 16:55:57,362 INFO L273 TraceCheckUtils]: 226: Hoare triple {10379#false} assume ~cond == 0; {10379#false} is VALID [2018-11-14 16:55:57,362 INFO L273 TraceCheckUtils]: 227: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2018-11-14 16:55:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-14 16:55:57,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:57,380 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-14 16:55:57,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:57,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:57,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:57,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:57,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10378#true} is VALID [2018-11-14 16:55:57,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {10378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10378#true} is VALID [2018-11-14 16:55:57,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2018-11-14 16:55:57,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #186#return; {10378#true} is VALID [2018-11-14 16:55:57,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret23 := main(); {10378#true} is VALID [2018-11-14 16:55:57,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {10378#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; {10407#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:57,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {10407#(<= main_~a~0 0)} assume true; {10407#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:57,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {10407#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10407#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:57,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {10407#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {10381#(<= main_~a~0 1)} assume true; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {10381#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10381#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:57,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {10381#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {10382#(<= main_~a~0 2)} assume true; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {10382#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10382#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:57,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {10382#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {10383#(<= main_~a~0 3)} assume true; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {10383#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10383#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:57,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {10383#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {10384#(<= main_~a~0 4)} assume true; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {10384#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10384#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:57,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {10384#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {10385#(<= main_~a~0 5)} assume true; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {10385#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10385#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:57,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {10385#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {10386#(<= main_~a~0 6)} assume true; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {10386#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10386#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:57,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {10386#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,852 INFO L273 TraceCheckUtils]: 27: Hoare triple {10387#(<= main_~a~0 7)} assume true; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {10387#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10387#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:57,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {10387#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10388#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:57,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {10388#(<= main_~a~0 8)} assume true; {10388#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:57,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {10388#(<= main_~a~0 8)} assume !(~a~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {10379#false} havoc ~i~0;~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 45: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 47: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 48: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {10379#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 53: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 54: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 55: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 67: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 68: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 69: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 70: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 71: Hoare triple {10379#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 72: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 73: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,860 INFO L273 TraceCheckUtils]: 74: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 75: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 76: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 77: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 78: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 82: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,861 INFO L273 TraceCheckUtils]: 83: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 84: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 85: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 86: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 87: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 88: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 89: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 90: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,862 INFO L273 TraceCheckUtils]: 91: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 92: Hoare triple {10379#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 93: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 94: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 95: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 96: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 97: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 98: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 99: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 100: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,863 INFO L273 TraceCheckUtils]: 101: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 102: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 103: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 104: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 105: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 106: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 107: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 108: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 109: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,864 INFO L273 TraceCheckUtils]: 110: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 111: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 112: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 113: Hoare triple {10379#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 114: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 115: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 116: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 117: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,865 INFO L273 TraceCheckUtils]: 118: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,866 INFO L273 TraceCheckUtils]: 119: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,866 INFO L273 TraceCheckUtils]: 120: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,866 INFO L273 TraceCheckUtils]: 121: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,866 INFO L273 TraceCheckUtils]: 122: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,866 INFO L273 TraceCheckUtils]: 123: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 124: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 125: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 126: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 127: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 128: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 129: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 130: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 131: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,867 INFO L273 TraceCheckUtils]: 132: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 133: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 134: Hoare triple {10379#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 135: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 136: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 137: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 138: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 139: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 140: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 141: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,868 INFO L273 TraceCheckUtils]: 142: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 143: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 144: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 145: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 146: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 147: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 148: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 149: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 150: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,869 INFO L273 TraceCheckUtils]: 151: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 152: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 153: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 154: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 155: Hoare triple {10379#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 156: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 157: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 158: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 159: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 160: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,870 INFO L273 TraceCheckUtils]: 161: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 162: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 163: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 164: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 165: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 166: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 167: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 168: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 169: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,871 INFO L273 TraceCheckUtils]: 170: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 171: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 172: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 173: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 174: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 175: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 176: Hoare triple {10379#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 177: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,872 INFO L273 TraceCheckUtils]: 178: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 179: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 180: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 181: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 182: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 183: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 184: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 185: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 186: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,873 INFO L273 TraceCheckUtils]: 187: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 188: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 189: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 190: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 191: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 192: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 193: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 194: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 195: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,874 INFO L273 TraceCheckUtils]: 196: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 197: Hoare triple {10379#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 198: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 199: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 200: Hoare triple {10379#false} ~i~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 201: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 202: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 203: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 204: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,875 INFO L273 TraceCheckUtils]: 205: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 206: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 207: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 208: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 209: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 210: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 211: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 212: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,876 INFO L273 TraceCheckUtils]: 213: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 214: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 215: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 216: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 217: Hoare triple {10379#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 218: Hoare triple {10379#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 219: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 220: Hoare triple {10379#false} assume !(~i~0 < 100000); {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 221: Hoare triple {10379#false} havoc ~x~0;~x~0 := 0; {10379#false} is VALID [2018-11-14 16:55:57,877 INFO L273 TraceCheckUtils]: 222: Hoare triple {10379#false} assume true; {10379#false} is VALID [2018-11-14 16:55:57,878 INFO L273 TraceCheckUtils]: 223: Hoare triple {10379#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {10379#false} is VALID [2018-11-14 16:55:57,878 INFO L256 TraceCheckUtils]: 224: Hoare triple {10379#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {10379#false} is VALID [2018-11-14 16:55:57,878 INFO L273 TraceCheckUtils]: 225: Hoare triple {10379#false} ~cond := #in~cond; {10379#false} is VALID [2018-11-14 16:55:57,878 INFO L273 TraceCheckUtils]: 226: Hoare triple {10379#false} assume ~cond == 0; {10379#false} is VALID [2018-11-14 16:55:57,878 INFO L273 TraceCheckUtils]: 227: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2018-11-14 16:55:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-14 16:55:57,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:57,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:55:57,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2018-11-14 16:55:57,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:57,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:55:57,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:57,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:55:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:55:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:57,993 INFO L87 Difference]: Start difference. First operand 233 states and 243 transitions. Second operand 12 states. [2018-11-14 16:55:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:58,802 INFO L93 Difference]: Finished difference Result 438 states and 458 transitions. [2018-11-14 16:55:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:55:58,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2018-11-14 16:55:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-14 16:55:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-14 16:55:58,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 152 transitions. [2018-11-14 16:55:59,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:59,431 INFO L225 Difference]: With dead ends: 438 [2018-11-14 16:55:59,432 INFO L226 Difference]: Without dead ends: 237 [2018-11-14 16:55:59,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-14 16:55:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-11-14 16:55:59,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:59,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand 236 states. [2018-11-14 16:55:59,504 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 236 states. [2018-11-14 16:55:59,504 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 236 states. [2018-11-14 16:55:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:59,510 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2018-11-14 16:55:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 247 transitions. [2018-11-14 16:55:59,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:59,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:59,511 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 237 states. [2018-11-14 16:55:59,511 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 237 states. [2018-11-14 16:55:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:59,516 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2018-11-14 16:55:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 247 transitions. [2018-11-14 16:55:59,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:59,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:59,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:59,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-14 16:55:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 246 transitions. [2018-11-14 16:55:59,523 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 246 transitions. Word has length 228 [2018-11-14 16:55:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:59,523 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 246 transitions. [2018-11-14 16:55:59,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:55:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 246 transitions. [2018-11-14 16:55:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-14 16:55:59,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:59,527 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1] [2018-11-14 16:55:59,527 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:59,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1382538077, now seen corresponding path program 9 times [2018-11-14 16:55:59,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:59,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:59,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:00,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {12447#true} call ULTIMATE.init(); {12447#true} is VALID [2018-11-14 16:56:00,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {12447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12447#true} is VALID [2018-11-14 16:56:00,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:00,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12447#true} {12447#true} #186#return; {12447#true} is VALID [2018-11-14 16:56:00,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {12447#true} call #t~ret23 := main(); {12447#true} is VALID [2018-11-14 16:56:00,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {12447#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; {12449#(= main_~a~0 0)} is VALID [2018-11-14 16:56:00,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {12449#(= main_~a~0 0)} assume true; {12449#(= main_~a~0 0)} is VALID [2018-11-14 16:56:00,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {12449#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12449#(= main_~a~0 0)} is VALID [2018-11-14 16:56:00,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {12449#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12450#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:00,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {12450#(<= main_~a~0 1)} assume true; {12450#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:00,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {12450#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12450#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:00,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {12450#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12451#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:00,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {12451#(<= main_~a~0 2)} assume true; {12451#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:00,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {12451#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12451#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:00,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {12451#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12452#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:00,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {12452#(<= main_~a~0 3)} assume true; {12452#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:00,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {12452#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12452#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:00,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {12452#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12453#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:00,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {12453#(<= main_~a~0 4)} assume true; {12453#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:00,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {12453#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12453#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:00,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {12453#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12454#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:00,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {12454#(<= main_~a~0 5)} assume true; {12454#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:00,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {12454#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12454#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:00,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {12454#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12455#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:00,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {12455#(<= main_~a~0 6)} assume true; {12455#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:00,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {12455#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12455#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:00,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {12455#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12456#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:00,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {12456#(<= main_~a~0 7)} assume true; {12456#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:00,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {12456#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12456#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:00,231 INFO L273 TraceCheckUtils]: 29: Hoare triple {12456#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12457#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:00,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {12457#(<= main_~a~0 8)} assume true; {12457#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:00,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {12457#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12457#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:00,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {12457#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12458#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:00,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {12458#(<= main_~a~0 9)} assume true; {12458#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:00,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {12458#(<= main_~a~0 9)} assume !(~a~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {12448#false} havoc ~i~0;~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12448#false} is VALID [2018-11-14 16:56:00,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {12448#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 54: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 61: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,238 INFO L273 TraceCheckUtils]: 62: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 73: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 74: Hoare triple {12448#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 75: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 78: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 80: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 81: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 82: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 83: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 85: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,241 INFO L273 TraceCheckUtils]: 86: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 87: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 88: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 89: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 90: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 91: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 92: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 93: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 94: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12448#false} is VALID [2018-11-14 16:56:00,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {12448#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 97: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 98: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 99: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 100: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 101: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 102: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 104: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 105: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 108: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 109: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 110: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 111: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,244 INFO L273 TraceCheckUtils]: 112: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 113: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 114: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {12448#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 118: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 119: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,245 INFO L273 TraceCheckUtils]: 120: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 121: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 123: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 124: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 125: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 126: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 127: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 128: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,246 INFO L273 TraceCheckUtils]: 129: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 130: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 131: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 132: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 133: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 134: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 135: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 137: Hoare triple {12448#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12448#false} is VALID [2018-11-14 16:56:00,247 INFO L273 TraceCheckUtils]: 138: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 139: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 140: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 141: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 142: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 143: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 144: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 145: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 146: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,248 INFO L273 TraceCheckUtils]: 147: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 148: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 149: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 150: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 151: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 152: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 153: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 154: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,249 INFO L273 TraceCheckUtils]: 155: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 156: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 157: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 158: Hoare triple {12448#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 159: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 160: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 161: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 162: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 163: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,250 INFO L273 TraceCheckUtils]: 164: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 165: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 166: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 167: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 168: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 169: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 170: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 171: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 172: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,251 INFO L273 TraceCheckUtils]: 173: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 174: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 175: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 176: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 177: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 178: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 179: Hoare triple {12448#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 180: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 181: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,252 INFO L273 TraceCheckUtils]: 182: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 183: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 184: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 185: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 186: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 187: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 188: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 189: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,253 INFO L273 TraceCheckUtils]: 190: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 191: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 192: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 193: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 194: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 195: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 196: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 197: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 198: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,254 INFO L273 TraceCheckUtils]: 199: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 200: Hoare triple {12448#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 201: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 202: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 203: Hoare triple {12448#false} ~i~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 204: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 205: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 206: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 207: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,255 INFO L273 TraceCheckUtils]: 208: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 209: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 210: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 211: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 212: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 213: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 214: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 215: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,256 INFO L273 TraceCheckUtils]: 216: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 217: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 218: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 219: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 220: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 221: Hoare triple {12448#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 222: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 223: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 224: Hoare triple {12448#false} havoc ~x~0;~x~0 := 0; {12448#false} is VALID [2018-11-14 16:56:00,257 INFO L273 TraceCheckUtils]: 225: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:00,258 INFO L273 TraceCheckUtils]: 226: Hoare triple {12448#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {12448#false} is VALID [2018-11-14 16:56:00,258 INFO L256 TraceCheckUtils]: 227: Hoare triple {12448#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {12448#false} is VALID [2018-11-14 16:56:00,258 INFO L273 TraceCheckUtils]: 228: Hoare triple {12448#false} ~cond := #in~cond; {12448#false} is VALID [2018-11-14 16:56:00,258 INFO L273 TraceCheckUtils]: 229: Hoare triple {12448#false} assume ~cond == 0; {12448#false} is VALID [2018-11-14 16:56:00,258 INFO L273 TraceCheckUtils]: 230: Hoare triple {12448#false} assume !false; {12448#false} is VALID [2018-11-14 16:56:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-14 16:56:00,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:00,277 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-14 16:56:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:56:11,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 16:56:11,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:11,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:11,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {12447#true} call ULTIMATE.init(); {12447#true} is VALID [2018-11-14 16:56:11,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {12447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12447#true} is VALID [2018-11-14 16:56:11,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12447#true} {12447#true} #186#return; {12447#true} is VALID [2018-11-14 16:56:11,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {12447#true} call #t~ret23 := main(); {12447#true} is VALID [2018-11-14 16:56:11,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {12447#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; {12447#true} is VALID [2018-11-14 16:56:11,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12447#true} is VALID [2018-11-14 16:56:11,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {12447#true} assume !(~a~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {12447#true} havoc ~i~0;~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12447#true} is VALID [2018-11-14 16:56:11,733 INFO L273 TraceCheckUtils]: 38: Hoare triple {12447#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 39: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 41: Hoare triple {12447#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 42: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 43: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12447#true} is VALID [2018-11-14 16:56:11,734 INFO L273 TraceCheckUtils]: 44: Hoare triple {12447#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 45: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 46: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {12447#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 49: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12447#true} is VALID [2018-11-14 16:56:11,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {12447#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12447#true} is VALID [2018-11-14 16:56:11,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12618#(< main_~i~0 100000)} is VALID [2018-11-14 16:56:11,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {12618#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,765 INFO L273 TraceCheckUtils]: 54: Hoare triple {12622#(<= main_~i~0 100000)} assume true; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,765 INFO L273 TraceCheckUtils]: 55: Hoare triple {12622#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {12447#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {12447#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 64: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {12447#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,766 INFO L273 TraceCheckUtils]: 67: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {12447#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 69: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 70: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 71: Hoare triple {12447#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 72: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,767 INFO L273 TraceCheckUtils]: 73: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12618#(< main_~i~0 100000)} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 74: Hoare triple {12618#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 75: Hoare triple {12622#(<= main_~i~0 100000)} assume true; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 76: Hoare triple {12622#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 77: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 78: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,769 INFO L273 TraceCheckUtils]: 79: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 80: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 81: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 82: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 83: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 84: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 85: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 86: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,771 INFO L273 TraceCheckUtils]: 88: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,771 INFO L273 TraceCheckUtils]: 89: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,771 INFO L273 TraceCheckUtils]: 90: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,771 INFO L273 TraceCheckUtils]: 91: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,771 INFO L273 TraceCheckUtils]: 92: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,772 INFO L273 TraceCheckUtils]: 93: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,772 INFO L273 TraceCheckUtils]: 94: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12447#true} is VALID [2018-11-14 16:56:11,772 INFO L273 TraceCheckUtils]: 95: Hoare triple {12447#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12447#true} is VALID [2018-11-14 16:56:11,772 INFO L273 TraceCheckUtils]: 96: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,772 INFO L273 TraceCheckUtils]: 97: Hoare triple {12447#true} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 98: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 99: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 100: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 101: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 102: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 103: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 104: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 105: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,773 INFO L273 TraceCheckUtils]: 106: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 107: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 108: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 109: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 110: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 111: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 112: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,774 INFO L273 TraceCheckUtils]: 113: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 114: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 115: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 116: Hoare triple {12447#true} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 117: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 118: Hoare triple {12447#true} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,775 INFO L273 TraceCheckUtils]: 119: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 120: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 121: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 122: Hoare triple {12447#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 123: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 124: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 125: Hoare triple {12447#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12447#true} is VALID [2018-11-14 16:56:11,776 INFO L273 TraceCheckUtils]: 126: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 127: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 128: Hoare triple {12447#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 129: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 130: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 131: Hoare triple {12447#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 132: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 133: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12447#true} is VALID [2018-11-14 16:56:11,777 INFO L273 TraceCheckUtils]: 134: Hoare triple {12447#true} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12447#true} is VALID [2018-11-14 16:56:11,778 INFO L273 TraceCheckUtils]: 135: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,778 INFO L273 TraceCheckUtils]: 136: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {12618#(< main_~i~0 100000)} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 137: Hoare triple {12618#(< main_~i~0 100000)} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 138: Hoare triple {12622#(<= main_~i~0 100000)} assume true; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 139: Hoare triple {12622#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 140: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 141: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,779 INFO L273 TraceCheckUtils]: 142: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 143: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 144: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 145: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 146: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 147: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 148: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 149: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 150: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,780 INFO L273 TraceCheckUtils]: 151: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 152: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 153: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 154: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 155: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 156: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 157: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 158: Hoare triple {12447#true} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {12447#true} is VALID [2018-11-14 16:56:11,781 INFO L273 TraceCheckUtils]: 159: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 160: Hoare triple {12447#true} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 161: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 162: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 163: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 164: Hoare triple {12447#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 165: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 166: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 167: Hoare triple {12447#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12447#true} is VALID [2018-11-14 16:56:11,782 INFO L273 TraceCheckUtils]: 168: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 169: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 170: Hoare triple {12447#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 171: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 172: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 173: Hoare triple {12447#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 174: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 175: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12447#true} is VALID [2018-11-14 16:56:11,783 INFO L273 TraceCheckUtils]: 176: Hoare triple {12447#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12447#true} is VALID [2018-11-14 16:56:11,784 INFO L273 TraceCheckUtils]: 177: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,785 INFO L273 TraceCheckUtils]: 178: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {12618#(< main_~i~0 100000)} is VALID [2018-11-14 16:56:11,785 INFO L273 TraceCheckUtils]: 179: Hoare triple {12618#(< main_~i~0 100000)} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 180: Hoare triple {12622#(<= main_~i~0 100000)} assume true; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 181: Hoare triple {12622#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 182: Hoare triple {12447#true} ~i~0 := 0; {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 183: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 184: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 185: Hoare triple {12447#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 186: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,787 INFO L273 TraceCheckUtils]: 187: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 188: Hoare triple {12447#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 189: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 190: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 191: Hoare triple {12447#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 192: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 193: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 194: Hoare triple {12447#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12447#true} is VALID [2018-11-14 16:56:11,788 INFO L273 TraceCheckUtils]: 195: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,789 INFO L273 TraceCheckUtils]: 196: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12447#true} is VALID [2018-11-14 16:56:11,789 INFO L273 TraceCheckUtils]: 197: Hoare triple {12447#true} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12447#true} is VALID [2018-11-14 16:56:11,789 INFO L273 TraceCheckUtils]: 198: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-14 16:56:11,790 INFO L273 TraceCheckUtils]: 199: Hoare triple {12447#true} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {12618#(< main_~i~0 100000)} is VALID [2018-11-14 16:56:11,792 INFO L273 TraceCheckUtils]: 200: Hoare triple {12618#(< main_~i~0 100000)} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,792 INFO L273 TraceCheckUtils]: 201: Hoare triple {12622#(<= main_~i~0 100000)} assume true; {12622#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:11,792 INFO L273 TraceCheckUtils]: 202: Hoare triple {12622#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12447#true} is VALID [2018-11-14 16:56:11,794 INFO L273 TraceCheckUtils]: 203: Hoare triple {12447#true} ~i~0 := 0; {13073#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:11,794 INFO L273 TraceCheckUtils]: 204: Hoare triple {13073#(<= main_~i~0 0)} assume true; {13073#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:11,796 INFO L273 TraceCheckUtils]: 205: Hoare triple {13073#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13073#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:11,796 INFO L273 TraceCheckUtils]: 206: Hoare triple {13073#(<= main_~i~0 0)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13083#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,798 INFO L273 TraceCheckUtils]: 207: Hoare triple {13083#(<= main_~i~0 1)} assume true; {13083#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,798 INFO L273 TraceCheckUtils]: 208: Hoare triple {13083#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13083#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,800 INFO L273 TraceCheckUtils]: 209: Hoare triple {13083#(<= main_~i~0 1)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13093#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,800 INFO L273 TraceCheckUtils]: 210: Hoare triple {13093#(<= main_~i~0 2)} assume true; {13093#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,820 INFO L273 TraceCheckUtils]: 211: Hoare triple {13093#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13093#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,834 INFO L273 TraceCheckUtils]: 212: Hoare triple {13093#(<= main_~i~0 2)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13103#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,843 INFO L273 TraceCheckUtils]: 213: Hoare triple {13103#(<= main_~i~0 3)} assume true; {13103#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,856 INFO L273 TraceCheckUtils]: 214: Hoare triple {13103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13103#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,865 INFO L273 TraceCheckUtils]: 215: Hoare triple {13103#(<= main_~i~0 3)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13113#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,874 INFO L273 TraceCheckUtils]: 216: Hoare triple {13113#(<= main_~i~0 4)} assume true; {13113#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,885 INFO L273 TraceCheckUtils]: 217: Hoare triple {13113#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13113#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,886 INFO L273 TraceCheckUtils]: 218: Hoare triple {13113#(<= main_~i~0 4)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13123#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,891 INFO L273 TraceCheckUtils]: 219: Hoare triple {13123#(<= main_~i~0 5)} assume true; {13123#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,891 INFO L273 TraceCheckUtils]: 220: Hoare triple {13123#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {13123#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,893 INFO L273 TraceCheckUtils]: 221: Hoare triple {13123#(<= main_~i~0 5)} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {13133#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,893 INFO L273 TraceCheckUtils]: 222: Hoare triple {13133#(<= main_~i~0 6)} assume true; {13133#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,893 INFO L273 TraceCheckUtils]: 223: Hoare triple {13133#(<= main_~i~0 6)} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 224: Hoare triple {12448#false} havoc ~x~0;~x~0 := 0; {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 225: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 226: Hoare triple {12448#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L256 TraceCheckUtils]: 227: Hoare triple {12448#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 228: Hoare triple {12448#false} ~cond := #in~cond; {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 229: Hoare triple {12448#false} assume ~cond == 0; {12448#false} is VALID [2018-11-14 16:56:11,894 INFO L273 TraceCheckUtils]: 230: Hoare triple {12448#false} assume !false; {12448#false} is VALID [2018-11-14 16:56:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 85 proven. 57 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-11-14 16:56:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:11,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-14 16:56:11,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 231 [2018-11-14 16:56:11,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:11,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:56:12,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:12,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:56:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:56:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:56:12,133 INFO L87 Difference]: Start difference. First operand 236 states and 246 transitions. Second operand 21 states. [2018-11-14 16:56:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:14,234 INFO L93 Difference]: Finished difference Result 495 states and 533 transitions. [2018-11-14 16:56:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:56:14,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 231 [2018-11-14 16:56:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:56:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 380 transitions. [2018-11-14 16:56:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:56:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 380 transitions. [2018-11-14 16:56:14,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 380 transitions. [2018-11-14 16:56:15,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:15,561 INFO L225 Difference]: With dead ends: 495 [2018-11-14 16:56:15,561 INFO L226 Difference]: Without dead ends: 294 [2018-11-14 16:56:15,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:56:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-14 16:56:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-11-14 16:56:17,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:17,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand 293 states. [2018-11-14 16:56:17,684 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand 293 states. [2018-11-14 16:56:17,684 INFO L87 Difference]: Start difference. First operand 294 states. Second operand 293 states. [2018-11-14 16:56:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:17,690 INFO L93 Difference]: Finished difference Result 294 states and 304 transitions. [2018-11-14 16:56:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 304 transitions. [2018-11-14 16:56:17,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:17,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:17,691 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand 294 states. [2018-11-14 16:56:17,691 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 294 states. [2018-11-14 16:56:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:17,698 INFO L93 Difference]: Finished difference Result 294 states and 304 transitions. [2018-11-14 16:56:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 304 transitions. [2018-11-14 16:56:17,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:17,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:17,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:17,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-14 16:56:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 303 transitions. [2018-11-14 16:56:17,706 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 303 transitions. Word has length 231 [2018-11-14 16:56:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:17,707 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 303 transitions. [2018-11-14 16:56:17,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:56:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 303 transitions. [2018-11-14 16:56:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-14 16:56:17,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:17,710 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1] [2018-11-14 16:56:17,711 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:17,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1008264110, now seen corresponding path program 10 times [2018-11-14 16:56:17,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:17,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:18,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {14800#true} call ULTIMATE.init(); {14800#true} is VALID [2018-11-14 16:56:18,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {14800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14800#true} is VALID [2018-11-14 16:56:18,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {14800#true} assume true; {14800#true} is VALID [2018-11-14 16:56:18,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14800#true} {14800#true} #186#return; {14800#true} is VALID [2018-11-14 16:56:18,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {14800#true} call #t~ret23 := main(); {14800#true} is VALID [2018-11-14 16:56:18,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {14800#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; {14802#(= main_~a~0 0)} is VALID [2018-11-14 16:56:18,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {14802#(= main_~a~0 0)} assume true; {14802#(= main_~a~0 0)} is VALID [2018-11-14 16:56:18,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {14802#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14802#(= main_~a~0 0)} is VALID [2018-11-14 16:56:18,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {14802#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:18,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {14803#(<= main_~a~0 1)} assume true; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:18,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {14803#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:18,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {14803#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:18,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {14804#(<= main_~a~0 2)} assume true; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:18,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {14804#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:18,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {14804#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:18,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {14805#(<= main_~a~0 3)} assume true; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:18,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {14805#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:18,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {14805#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:18,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {14806#(<= main_~a~0 4)} assume true; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:18,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {14806#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:18,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {14806#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:18,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {14807#(<= main_~a~0 5)} assume true; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:18,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {14807#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:18,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {14807#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:18,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {14808#(<= main_~a~0 6)} assume true; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:18,584 INFO L273 TraceCheckUtils]: 25: Hoare triple {14808#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:18,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {14808#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:18,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {14809#(<= main_~a~0 7)} assume true; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:18,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {14809#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:18,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {14809#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:18,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {14810#(<= main_~a~0 8)} assume true; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:18,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {14810#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:18,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {14810#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:18,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {14811#(<= main_~a~0 9)} assume true; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:18,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {14811#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:18,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {14811#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14812#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:18,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {14812#(<= main_~a~0 10)} assume true; {14812#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:18,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {14812#(<= main_~a~0 10)} assume !(~a~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {14801#false} havoc ~i~0;~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,592 INFO L273 TraceCheckUtils]: 40: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,592 INFO L273 TraceCheckUtils]: 42: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,592 INFO L273 TraceCheckUtils]: 43: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 44: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,593 INFO L273 TraceCheckUtils]: 49: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 50: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 51: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 52: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 54: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 58: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 59: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 64: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,595 INFO L273 TraceCheckUtils]: 66: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 67: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 71: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 72: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 73: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 74: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,596 INFO L273 TraceCheckUtils]: 75: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 76: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 77: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 78: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 79: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 80: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 81: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 82: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,597 INFO L273 TraceCheckUtils]: 83: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 85: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 86: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 87: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 88: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 89: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 90: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,598 INFO L273 TraceCheckUtils]: 92: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 93: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 94: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 95: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 96: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 97: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 98: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 99: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 100: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,599 INFO L273 TraceCheckUtils]: 101: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 102: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 103: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 104: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 105: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 106: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 107: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 108: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,600 INFO L273 TraceCheckUtils]: 109: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 110: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 111: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 112: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 113: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 115: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 116: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 117: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,601 INFO L273 TraceCheckUtils]: 118: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 119: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 120: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 121: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 124: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 125: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 126: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,602 INFO L273 TraceCheckUtils]: 127: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 128: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 129: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 130: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 131: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 132: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 133: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 134: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,603 INFO L273 TraceCheckUtils]: 135: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 136: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 137: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 138: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 139: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 140: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 141: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 142: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 143: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:18,604 INFO L273 TraceCheckUtils]: 144: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 145: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 146: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 147: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 148: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 149: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 150: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 151: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 152: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,605 INFO L273 TraceCheckUtils]: 153: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 154: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 155: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 156: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 157: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 158: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 159: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 160: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 161: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,606 INFO L273 TraceCheckUtils]: 162: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 163: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 164: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 165: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 166: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 167: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 168: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 169: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:18,607 INFO L273 TraceCheckUtils]: 170: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 171: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 172: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 173: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 174: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 175: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 176: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 177: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 178: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,608 INFO L273 TraceCheckUtils]: 179: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 180: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 181: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 182: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 183: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 184: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 185: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 186: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 187: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,609 INFO L273 TraceCheckUtils]: 188: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 189: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 190: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 191: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 192: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 193: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 194: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 195: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,610 INFO L273 TraceCheckUtils]: 196: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 197: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 198: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 199: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 200: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 201: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 202: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 203: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 204: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,611 INFO L273 TraceCheckUtils]: 205: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 206: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 207: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 208: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 209: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 210: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 211: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 212: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 213: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,612 INFO L273 TraceCheckUtils]: 214: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 215: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 216: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 217: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 218: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 219: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 220: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 221: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,613 INFO L273 TraceCheckUtils]: 222: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 223: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 224: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 225: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 226: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 227: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 228: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 229: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,614 INFO L273 TraceCheckUtils]: 230: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 231: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 232: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 233: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 234: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 235: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,615 INFO L273 TraceCheckUtils]: 236: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,616 INFO L273 TraceCheckUtils]: 237: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,616 INFO L273 TraceCheckUtils]: 238: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,616 INFO L273 TraceCheckUtils]: 239: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,616 INFO L273 TraceCheckUtils]: 240: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,616 INFO L273 TraceCheckUtils]: 241: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 242: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 243: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 244: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 245: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 246: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,617 INFO L273 TraceCheckUtils]: 247: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 248: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 249: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 250: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 251: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 252: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,618 INFO L273 TraceCheckUtils]: 253: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 254: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 255: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 256: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 257: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 258: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 259: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,619 INFO L273 TraceCheckUtils]: 260: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 261: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 262: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 263: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 264: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 265: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,620 INFO L273 TraceCheckUtils]: 266: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 267: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 268: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 269: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 270: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 271: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,621 INFO L273 TraceCheckUtils]: 272: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 273: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 274: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 275: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 276: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 277: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:18,622 INFO L273 TraceCheckUtils]: 278: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L273 TraceCheckUtils]: 279: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L273 TraceCheckUtils]: 280: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L273 TraceCheckUtils]: 281: Hoare triple {14801#false} havoc ~x~0;~x~0 := 0; {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L273 TraceCheckUtils]: 282: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L273 TraceCheckUtils]: 283: Hoare triple {14801#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {14801#false} is VALID [2018-11-14 16:56:18,623 INFO L256 TraceCheckUtils]: 284: Hoare triple {14801#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {14801#false} is VALID [2018-11-14 16:56:18,624 INFO L273 TraceCheckUtils]: 285: Hoare triple {14801#false} ~cond := #in~cond; {14801#false} is VALID [2018-11-14 16:56:18,624 INFO L273 TraceCheckUtils]: 286: Hoare triple {14801#false} assume ~cond == 0; {14801#false} is VALID [2018-11-14 16:56:18,624 INFO L273 TraceCheckUtils]: 287: Hoare triple {14801#false} assume !false; {14801#false} is VALID [2018-11-14 16:56:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-14 16:56:18,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:18,658 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-14 16:56:18,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:56:18,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:56:18,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:18,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:19,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {14800#true} call ULTIMATE.init(); {14800#true} is VALID [2018-11-14 16:56:19,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {14800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14800#true} is VALID [2018-11-14 16:56:19,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {14800#true} assume true; {14800#true} is VALID [2018-11-14 16:56:19,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14800#true} {14800#true} #186#return; {14800#true} is VALID [2018-11-14 16:56:19,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {14800#true} call #t~ret23 := main(); {14800#true} is VALID [2018-11-14 16:56:19,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {14800#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; {14831#(<= main_~a~0 0)} is VALID [2018-11-14 16:56:19,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {14831#(<= main_~a~0 0)} assume true; {14831#(<= main_~a~0 0)} is VALID [2018-11-14 16:56:19,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {14831#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14831#(<= main_~a~0 0)} is VALID [2018-11-14 16:56:19,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {14831#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:19,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {14803#(<= main_~a~0 1)} assume true; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:19,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {14803#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14803#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:19,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {14803#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:19,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {14804#(<= main_~a~0 2)} assume true; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:19,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {14804#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14804#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:19,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {14804#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:19,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {14805#(<= main_~a~0 3)} assume true; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:19,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {14805#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14805#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:19,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {14805#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:19,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {14806#(<= main_~a~0 4)} assume true; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:19,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {14806#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14806#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:19,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {14806#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:19,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {14807#(<= main_~a~0 5)} assume true; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:19,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {14807#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14807#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:19,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {14807#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:19,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {14808#(<= main_~a~0 6)} assume true; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:19,249 INFO L273 TraceCheckUtils]: 25: Hoare triple {14808#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14808#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:19,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {14808#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:19,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {14809#(<= main_~a~0 7)} assume true; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:19,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {14809#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14809#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:19,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {14809#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:19,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {14810#(<= main_~a~0 8)} assume true; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:19,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {14810#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14810#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:19,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {14810#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:19,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {14811#(<= main_~a~0 9)} assume true; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:19,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {14811#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14811#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:19,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {14811#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14812#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:19,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {14812#(<= main_~a~0 10)} assume true; {14812#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:19,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {14812#(<= main_~a~0 10)} assume !(~a~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {14801#false} havoc ~i~0;~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,259 INFO L273 TraceCheckUtils]: 44: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 57: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 62: Hoare triple {14801#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14801#false} is VALID [2018-11-14 16:56:19,261 INFO L273 TraceCheckUtils]: 63: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 70: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,262 INFO L273 TraceCheckUtils]: 72: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 74: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 75: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 76: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 82: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 89: Hoare triple {14801#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14801#false} is VALID [2018-11-14 16:56:19,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 91: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 96: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,265 INFO L273 TraceCheckUtils]: 98: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 99: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 101: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 104: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 106: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,266 INFO L273 TraceCheckUtils]: 107: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 108: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 109: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 110: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 111: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 112: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,267 INFO L273 TraceCheckUtils]: 115: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {14801#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 117: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 118: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 119: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 120: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,268 INFO L273 TraceCheckUtils]: 121: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 122: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 123: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 124: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 125: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 126: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,269 INFO L273 TraceCheckUtils]: 127: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,270 INFO L273 TraceCheckUtils]: 128: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,270 INFO L273 TraceCheckUtils]: 129: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,270 INFO L273 TraceCheckUtils]: 130: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,270 INFO L273 TraceCheckUtils]: 131: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,270 INFO L273 TraceCheckUtils]: 132: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 134: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 135: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 136: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 137: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,271 INFO L273 TraceCheckUtils]: 138: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 139: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 140: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 141: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 142: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 143: Hoare triple {14801#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14801#false} is VALID [2018-11-14 16:56:19,272 INFO L273 TraceCheckUtils]: 144: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 145: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 146: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 147: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 148: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 149: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,273 INFO L273 TraceCheckUtils]: 150: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 151: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 152: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 153: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 154: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 155: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,274 INFO L273 TraceCheckUtils]: 156: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,275 INFO L273 TraceCheckUtils]: 157: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,275 INFO L273 TraceCheckUtils]: 158: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,275 INFO L273 TraceCheckUtils]: 159: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,275 INFO L273 TraceCheckUtils]: 160: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,275 INFO L273 TraceCheckUtils]: 161: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 162: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 163: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 164: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 165: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 166: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,276 INFO L273 TraceCheckUtils]: 167: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 168: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 169: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 170: Hoare triple {14801#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 171: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 172: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,277 INFO L273 TraceCheckUtils]: 173: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 174: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 175: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 176: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 177: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 178: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,278 INFO L273 TraceCheckUtils]: 179: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,279 INFO L273 TraceCheckUtils]: 180: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,279 INFO L273 TraceCheckUtils]: 181: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,279 INFO L273 TraceCheckUtils]: 182: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,279 INFO L273 TraceCheckUtils]: 183: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,279 INFO L273 TraceCheckUtils]: 184: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 185: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 186: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 187: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 188: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 189: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,280 INFO L273 TraceCheckUtils]: 190: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 191: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 192: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 193: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 194: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 195: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,281 INFO L273 TraceCheckUtils]: 196: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 197: Hoare triple {14801#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 198: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 199: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 200: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 201: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,282 INFO L273 TraceCheckUtils]: 202: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 203: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 204: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 205: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 206: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 207: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,283 INFO L273 TraceCheckUtils]: 208: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 209: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 210: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 211: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 212: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 213: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,284 INFO L273 TraceCheckUtils]: 214: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 215: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 216: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 217: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 218: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 219: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,285 INFO L273 TraceCheckUtils]: 220: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,286 INFO L273 TraceCheckUtils]: 221: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,286 INFO L273 TraceCheckUtils]: 222: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,286 INFO L273 TraceCheckUtils]: 223: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {14801#false} is VALID [2018-11-14 16:56:19,286 INFO L273 TraceCheckUtils]: 224: Hoare triple {14801#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {14801#false} is VALID [2018-11-14 16:56:19,286 INFO L273 TraceCheckUtils]: 225: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,287 INFO L273 TraceCheckUtils]: 226: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,287 INFO L273 TraceCheckUtils]: 227: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,287 INFO L273 TraceCheckUtils]: 228: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,287 INFO L273 TraceCheckUtils]: 229: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 230: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 231: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 232: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 233: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 234: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,288 INFO L273 TraceCheckUtils]: 235: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 236: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 237: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 238: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 239: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 240: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,289 INFO L273 TraceCheckUtils]: 241: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,290 INFO L273 TraceCheckUtils]: 242: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,290 INFO L273 TraceCheckUtils]: 243: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,290 INFO L273 TraceCheckUtils]: 244: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,290 INFO L273 TraceCheckUtils]: 245: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,290 INFO L273 TraceCheckUtils]: 246: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,291 INFO L273 TraceCheckUtils]: 247: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,291 INFO L273 TraceCheckUtils]: 248: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,291 INFO L273 TraceCheckUtils]: 249: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,291 INFO L273 TraceCheckUtils]: 250: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {14801#false} is VALID [2018-11-14 16:56:19,291 INFO L273 TraceCheckUtils]: 251: Hoare triple {14801#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 252: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 253: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 254: Hoare triple {14801#false} ~i~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 255: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 256: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,292 INFO L273 TraceCheckUtils]: 257: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 258: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 259: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 260: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 261: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 262: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,293 INFO L273 TraceCheckUtils]: 263: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 264: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 265: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 266: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 267: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 268: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,294 INFO L273 TraceCheckUtils]: 269: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 270: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 271: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 272: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 273: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 274: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 275: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,295 INFO L273 TraceCheckUtils]: 276: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 277: Hoare triple {14801#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 278: Hoare triple {14801#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 279: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 280: Hoare triple {14801#false} assume !(~i~0 < 100000); {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 281: Hoare triple {14801#false} havoc ~x~0;~x~0 := 0; {14801#false} is VALID [2018-11-14 16:56:19,296 INFO L273 TraceCheckUtils]: 282: Hoare triple {14801#false} assume true; {14801#false} is VALID [2018-11-14 16:56:19,297 INFO L273 TraceCheckUtils]: 283: Hoare triple {14801#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {14801#false} is VALID [2018-11-14 16:56:19,297 INFO L256 TraceCheckUtils]: 284: Hoare triple {14801#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {14801#false} is VALID [2018-11-14 16:56:19,297 INFO L273 TraceCheckUtils]: 285: Hoare triple {14801#false} ~cond := #in~cond; {14801#false} is VALID [2018-11-14 16:56:19,297 INFO L273 TraceCheckUtils]: 286: Hoare triple {14801#false} assume ~cond == 0; {14801#false} is VALID [2018-11-14 16:56:19,297 INFO L273 TraceCheckUtils]: 287: Hoare triple {14801#false} assume !false; {14801#false} is VALID [2018-11-14 16:56:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-14 16:56:19,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:19,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:56:19,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-11-14 16:56:19,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:19,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:56:19,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:19,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:56:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:56:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:19,777 INFO L87 Difference]: Start difference. First operand 293 states and 303 transitions. Second operand 14 states. [2018-11-14 16:56:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:20,726 INFO L93 Difference]: Finished difference Result 552 states and 572 transitions. [2018-11-14 16:56:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:56:20,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-11-14 16:56:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2018-11-14 16:56:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2018-11-14 16:56:20,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 158 transitions. [2018-11-14 16:56:20,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:20,887 INFO L225 Difference]: With dead ends: 552 [2018-11-14 16:56:20,887 INFO L226 Difference]: Without dead ends: 297 [2018-11-14 16:56:20,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-14 16:56:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2018-11-14 16:56:21,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:21,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 296 states. [2018-11-14 16:56:21,316 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 296 states. [2018-11-14 16:56:21,316 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 296 states. [2018-11-14 16:56:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:21,322 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2018-11-14 16:56:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 307 transitions. [2018-11-14 16:56:21,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:21,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:21,324 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 297 states. [2018-11-14 16:56:21,324 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 297 states. [2018-11-14 16:56:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:21,331 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2018-11-14 16:56:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 307 transitions. [2018-11-14 16:56:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:21,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:21,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:21,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-14 16:56:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 306 transitions. [2018-11-14 16:56:21,341 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 306 transitions. Word has length 288 [2018-11-14 16:56:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:21,341 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 306 transitions. [2018-11-14 16:56:21,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:56:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 306 transitions. [2018-11-14 16:56:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-14 16:56:21,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:21,344 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1] [2018-11-14 16:56:21,344 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:21,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:21,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1445463107, now seen corresponding path program 11 times [2018-11-14 16:56:21,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:21,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:21,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:21,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:21,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:21,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {17403#true} call ULTIMATE.init(); {17403#true} is VALID [2018-11-14 16:56:21,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {17403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17403#true} is VALID [2018-11-14 16:56:21,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {17403#true} assume true; {17403#true} is VALID [2018-11-14 16:56:21,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17403#true} {17403#true} #186#return; {17403#true} is VALID [2018-11-14 16:56:21,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {17403#true} call #t~ret23 := main(); {17403#true} is VALID [2018-11-14 16:56:21,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {17403#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; {17405#(= main_~a~0 0)} is VALID [2018-11-14 16:56:21,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {17405#(= main_~a~0 0)} assume true; {17405#(= main_~a~0 0)} is VALID [2018-11-14 16:56:21,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {17405#(= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17405#(= main_~a~0 0)} is VALID [2018-11-14 16:56:21,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {17405#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17406#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:21,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {17406#(<= main_~a~0 1)} assume true; {17406#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:21,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {17406#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17406#(<= main_~a~0 1)} is VALID [2018-11-14 16:56:21,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {17406#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17407#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:21,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {17407#(<= main_~a~0 2)} assume true; {17407#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:21,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {17407#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17407#(<= main_~a~0 2)} is VALID [2018-11-14 16:56:21,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {17407#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17408#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:21,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {17408#(<= main_~a~0 3)} assume true; {17408#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:21,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {17408#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17408#(<= main_~a~0 3)} is VALID [2018-11-14 16:56:21,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {17408#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17409#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:21,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {17409#(<= main_~a~0 4)} assume true; {17409#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:21,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {17409#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17409#(<= main_~a~0 4)} is VALID [2018-11-14 16:56:21,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {17409#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17410#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:21,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {17410#(<= main_~a~0 5)} assume true; {17410#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:21,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {17410#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17410#(<= main_~a~0 5)} is VALID [2018-11-14 16:56:21,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {17410#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17411#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:21,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {17411#(<= main_~a~0 6)} assume true; {17411#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:21,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {17411#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17411#(<= main_~a~0 6)} is VALID [2018-11-14 16:56:21,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {17411#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17412#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:21,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {17412#(<= main_~a~0 7)} assume true; {17412#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:21,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {17412#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17412#(<= main_~a~0 7)} is VALID [2018-11-14 16:56:21,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {17412#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17413#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:21,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {17413#(<= main_~a~0 8)} assume true; {17413#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:21,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {17413#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17413#(<= main_~a~0 8)} is VALID [2018-11-14 16:56:21,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {17413#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17414#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:21,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {17414#(<= main_~a~0 9)} assume true; {17414#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:21,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {17414#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17414#(<= main_~a~0 9)} is VALID [2018-11-14 16:56:21,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {17414#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17415#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:21,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {17415#(<= main_~a~0 10)} assume true; {17415#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:21,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {17415#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {17415#(<= main_~a~0 10)} is VALID [2018-11-14 16:56:21,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {17415#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {17416#(<= main_~a~0 11)} is VALID [2018-11-14 16:56:21,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {17416#(<= main_~a~0 11)} assume true; {17416#(<= main_~a~0 11)} is VALID [2018-11-14 16:56:21,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {17416#(<= main_~a~0 11)} assume !(~a~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {17404#false} havoc ~i~0;~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,777 INFO L273 TraceCheckUtils]: 43: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,777 INFO L273 TraceCheckUtils]: 44: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,778 INFO L273 TraceCheckUtils]: 48: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,778 INFO L273 TraceCheckUtils]: 49: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,778 INFO L273 TraceCheckUtils]: 51: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,778 INFO L273 TraceCheckUtils]: 52: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 53: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 54: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 55: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,779 INFO L273 TraceCheckUtils]: 58: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 59: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 60: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 61: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 62: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 63: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 64: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {17404#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 66: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 70: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 71: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 75: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,781 INFO L273 TraceCheckUtils]: 76: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 77: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 78: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 79: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 80: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 81: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 82: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 83: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 84: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,782 INFO L273 TraceCheckUtils]: 85: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 86: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 87: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 88: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 89: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 90: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 91: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 92: Hoare triple {17404#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 93: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,783 INFO L273 TraceCheckUtils]: 94: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 95: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 96: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 97: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 98: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 99: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 100: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 101: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 102: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,784 INFO L273 TraceCheckUtils]: 103: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 104: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 105: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 106: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 107: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 108: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 109: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 110: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 111: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,785 INFO L273 TraceCheckUtils]: 112: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 113: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 114: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 115: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 116: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 117: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 118: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 119: Hoare triple {17404#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 120: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 121: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,786 INFO L273 TraceCheckUtils]: 122: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 123: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 124: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 125: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 126: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 127: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 128: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 129: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,787 INFO L273 TraceCheckUtils]: 130: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 131: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 132: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 133: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 134: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 135: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 136: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 137: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 138: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 139: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,788 INFO L273 TraceCheckUtils]: 140: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 141: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 142: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 143: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 144: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 145: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 146: Hoare triple {17404#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 147: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 148: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,789 INFO L273 TraceCheckUtils]: 149: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 150: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 151: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 152: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 153: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 154: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 155: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 156: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 157: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,790 INFO L273 TraceCheckUtils]: 158: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 159: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 160: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 161: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 162: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 163: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 164: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 165: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 166: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,791 INFO L273 TraceCheckUtils]: 167: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 168: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 169: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 170: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 171: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 172: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem11; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 173: Hoare triple {17404#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 174: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 175: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,792 INFO L273 TraceCheckUtils]: 176: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 177: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 178: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 179: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 180: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 181: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 182: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 183: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 184: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 185: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,793 INFO L273 TraceCheckUtils]: 186: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 187: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 188: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 189: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 190: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 191: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 192: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 193: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 194: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,794 INFO L273 TraceCheckUtils]: 195: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 196: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 197: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 198: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 199: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem13; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 200: Hoare triple {17404#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 201: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 202: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 203: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,795 INFO L273 TraceCheckUtils]: 204: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 205: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 206: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 207: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 208: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 209: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 210: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 211: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 212: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,796 INFO L273 TraceCheckUtils]: 213: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 214: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 215: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 216: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 217: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 218: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 219: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 220: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 221: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 222: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,797 INFO L273 TraceCheckUtils]: 223: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 224: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 225: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 226: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem15; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 227: Hoare triple {17404#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 228: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 229: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 230: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 231: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,798 INFO L273 TraceCheckUtils]: 232: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 233: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 234: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 235: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 236: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 237: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 238: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 239: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 240: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,799 INFO L273 TraceCheckUtils]: 241: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 242: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 243: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 244: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 245: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 246: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 247: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 248: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 249: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,800 INFO L273 TraceCheckUtils]: 250: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 251: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 252: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 253: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);havoc #t~mem17; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 254: Hoare triple {17404#false} #t~post16 := ~i~0;~i~0 := #t~post16 + 1;havoc #t~post16; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 255: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 256: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 257: Hoare triple {17404#false} ~i~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 258: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,801 INFO L273 TraceCheckUtils]: 259: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 260: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 261: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 262: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 263: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 264: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 265: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,802 INFO L273 TraceCheckUtils]: 266: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 267: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 268: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 269: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 270: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 271: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 272: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,803 INFO L273 TraceCheckUtils]: 273: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 274: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 275: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 276: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 277: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 278: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 279: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 280: Hoare triple {17404#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem19; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 281: Hoare triple {17404#false} #t~post18 := ~i~0;~i~0 := #t~post18 + 1;havoc #t~post18; {17404#false} is VALID [2018-11-14 16:56:21,804 INFO L273 TraceCheckUtils]: 282: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 283: Hoare triple {17404#false} assume !(~i~0 < 100000); {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 284: Hoare triple {17404#false} havoc ~x~0;~x~0 := 0; {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 285: Hoare triple {17404#false} assume true; {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 286: Hoare triple {17404#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L256 TraceCheckUtils]: 287: Hoare triple {17404#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 288: Hoare triple {17404#false} ~cond := #in~cond; {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 289: Hoare triple {17404#false} assume ~cond == 0; {17404#false} is VALID [2018-11-14 16:56:21,805 INFO L273 TraceCheckUtils]: 290: Hoare triple {17404#false} assume !false; {17404#false} is VALID [2018-11-14 16:56:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-14 16:56:21,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:21,836 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-14 16:56:21,845 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1