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_copyInitSum3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:52:58,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:52:58,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:52:58,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:52:58,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:52:58,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:52:58,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:52:58,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:52:58,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:52:58,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:52:58,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:52:58,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:52:58,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:52:58,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:52:58,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:52:58,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:52:58,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:52:58,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:52:58,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:52:58,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:52:58,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:52:58,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:52:58,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:52:58,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:52:58,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:52:58,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:52:58,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:52:58,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:52:58,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:52:58,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:52:58,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:52:58,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:52:58,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:52:58,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:52:58,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:52:58,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:52:58,227 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-18 22:52:58,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:52:58,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:52:58,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:52:58,247 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:52:58,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:52:58,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:52:58,250 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:52:58,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:52:58,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:52:58,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:52:58,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:52:58,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:52:58,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:52:58,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:52:58,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:52:58,253 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:52:58,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:52:58,253 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:52:58,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:52:58,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:52:58,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:52:58,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:52:58,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:52:58,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:52:58,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:52:58,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:52:58,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:52:58,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:52:58,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:52:58,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:52:58,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:52:58,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:52:58,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:52:58,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:52:58,327 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:52:58,328 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:52:58,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum3_true-unreach-call_ground.i [2018-11-18 22:52:58,403 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850bcffdd/c665d43178c948399b96f1e909a984b9/FLAG7e984aa48 [2018-11-18 22:52:58,888 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:52:58,890 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum3_true-unreach-call_ground.i [2018-11-18 22:52:58,898 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850bcffdd/c665d43178c948399b96f1e909a984b9/FLAG7e984aa48 [2018-11-18 22:52:59,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850bcffdd/c665d43178c948399b96f1e909a984b9 [2018-11-18 22:52:59,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:52:59,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:52:59,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:52:59,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:52:59,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:52:59,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a065528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59, skipping insertion in model container [2018-11-18 22:52:59,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:52:59,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:52:59,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:52:59,547 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:52:59,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:52:59,607 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:52:59,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59 WrapperNode [2018-11-18 22:52:59,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:52:59,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:52:59,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:52:59,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:52:59,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (1/1) ... [2018-11-18 22:52:59,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:52:59,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:52:59,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:52:59,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:52:59,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (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-18 22:52:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:52:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:52:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:52:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:52:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:52:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:52:59,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:52:59,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:52:59,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:53:00,559 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:53:00,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:00 BoogieIcfgContainer [2018-11-18 22:53:00,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:53:00,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:53:00,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:53:00,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:53:00,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:52:59" (1/3) ... [2018-11-18 22:53:00,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a69b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:00, skipping insertion in model container [2018-11-18 22:53:00,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:52:59" (2/3) ... [2018-11-18 22:53:00,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a69b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:00, skipping insertion in model container [2018-11-18 22:53:00,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:00" (3/3) ... [2018-11-18 22:53:00,569 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum3_true-unreach-call_ground.i [2018-11-18 22:53:00,578 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:53:00,586 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:53:00,603 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:53:00,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:53:00,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:53:00,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:53:00,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:53:00,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:53:00,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:53:00,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:53:00,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:53:00,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:53:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-18 22:53:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:53:00,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:00,669 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] [2018-11-18 22:53:00,672 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:00,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1433518266, now seen corresponding path program 1 times [2018-11-18 22:53:00,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:00,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-18 22:53:00,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-18 22:53:00,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-18 22:53:00,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2018-11-18 22:53:00,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2018-11-18 22:53:00,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40#true} is VALID [2018-11-18 22:53:00,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-18 22:53:00,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-18 22:53:00,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-18 22:53:00,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-18 22:53:00,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-18 22:53:00,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-18 22:53:00,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-18 22:53:00,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} havoc ~x~0;~x~0 := 0; {41#false} is VALID [2018-11-18 22:53:00,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-18 22:53:00,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {41#false} is VALID [2018-11-18 22:53:00,837 INFO L256 TraceCheckUtils]: 16: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {41#false} is VALID [2018-11-18 22:53:00,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-18 22:53:00,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2018-11-18 22:53:00,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-18 22:53:00,842 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-18 22:53:00,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:00,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:53:00,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:53:00,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:00,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:53:01,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:01,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:53:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:53:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:53:01,089 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-18 22:53:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:01,331 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-18 22:53:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:53:01,332 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:53:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-18 22:53:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-18 22:53:01,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2018-11-18 22:53:01,643 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-18 22:53:01,654 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:53:01,655 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 22:53:01,659 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-18 22:53:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 22:53:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-18 22:53:01,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:01,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-18 22:53:01,709 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-18 22:53:01,710 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-18 22:53:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:01,714 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-18 22:53:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 22:53:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:01,716 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-18 22:53:01,716 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-18 22:53:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:01,720 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-18 22:53:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 22:53:01,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:01,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:01,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:01,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:53:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-18 22:53:01,727 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-11-18 22:53:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:01,727 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-18 22:53:01,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:53:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 22:53:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:53:01,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:01,729 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] [2018-11-18 22:53:01,729 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1838019965, now seen corresponding path program 1 times [2018-11-18 22:53:01,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:01,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2018-11-18 22:53:01,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {234#true} is VALID [2018-11-18 22:53:01,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-18 22:53:01,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #95#return; {234#true} is VALID [2018-11-18 22:53:01,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret9 := main(); {234#true} is VALID [2018-11-18 22:53:01,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {234#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {236#(= main_~i~0 0)} is VALID [2018-11-18 22:53:01,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {236#(= main_~i~0 0)} assume true; {236#(= main_~i~0 0)} is VALID [2018-11-18 22:53:01,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {236#(= main_~i~0 0)} assume !(~i~0 < 100000); {235#false} is VALID [2018-11-18 22:53:01,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {235#false} ~i~0 := 0; {235#false} is VALID [2018-11-18 22:53:01,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {235#false} assume true; {235#false} is VALID [2018-11-18 22:53:01,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {235#false} assume !(~i~0 < 100000); {235#false} is VALID [2018-11-18 22:53:01,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {235#false} ~i~0 := 0; {235#false} is VALID [2018-11-18 22:53:01,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {235#false} assume true; {235#false} is VALID [2018-11-18 22:53:01,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {235#false} assume !(~i~0 < 100000); {235#false} is VALID [2018-11-18 22:53:01,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {235#false} ~i~0 := 0; {235#false} is VALID [2018-11-18 22:53:01,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {235#false} assume true; {235#false} is VALID [2018-11-18 22:53:01,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {235#false} assume !(~i~0 < 100000); {235#false} is VALID [2018-11-18 22:53:01,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {235#false} havoc ~x~0;~x~0 := 0; {235#false} is VALID [2018-11-18 22:53:01,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {235#false} assume true; {235#false} is VALID [2018-11-18 22:53:01,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {235#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {235#false} is VALID [2018-11-18 22:53:01,832 INFO L256 TraceCheckUtils]: 20: Hoare triple {235#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {235#false} is VALID [2018-11-18 22:53:01,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2018-11-18 22:53:01,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2018-11-18 22:53:01,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {235#false} assume !false; {235#false} is VALID [2018-11-18 22:53:01,840 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-18 22:53:01,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:01,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:53:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:53:01,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:01,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:53:01,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:01,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:53:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:53:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:53:01,896 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-11-18 22:53:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:02,456 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-18 22:53:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:53:02,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:53:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 22:53:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 22:53:02,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-18 22:53:02,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:02,692 INFO L225 Difference]: With dead ends: 67 [2018-11-18 22:53:02,692 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 22:53:02,693 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-18 22:53:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 22:53:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-18 22:53:02,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:02,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2018-11-18 22:53:02,816 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2018-11-18 22:53:02,816 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2018-11-18 22:53:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:02,820 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-18 22:53:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 22:53:02,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:02,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:02,821 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2018-11-18 22:53:02,822 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2018-11-18 22:53:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:02,825 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-18 22:53:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 22:53:02,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:02,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:02,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:02,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:53:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-18 22:53:02,830 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2018-11-18 22:53:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:02,830 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-18 22:53:02,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:53:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-18 22:53:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:53:02,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:02,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:02,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:02,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1356258061, now seen corresponding path program 1 times [2018-11-18 22:53:02,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:02,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:02,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:02,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:02,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:02,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2018-11-18 22:53:02,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {468#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {468#true} is VALID [2018-11-18 22:53:02,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2018-11-18 22:53:02,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #95#return; {468#true} is VALID [2018-11-18 22:53:02,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret9 := main(); {468#true} is VALID [2018-11-18 22:53:02,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {468#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {470#(= main_~i~0 0)} is VALID [2018-11-18 22:53:02,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {470#(= main_~i~0 0)} assume true; {470#(= main_~i~0 0)} is VALID [2018-11-18 22:53:02,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {470#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {471#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:02,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {471#(<= main_~i~0 1)} assume true; {471#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:02,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {471#(<= main_~i~0 1)} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:02,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:02,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {469#false} is VALID [2018-11-18 22:53:02,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {469#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {469#false} is VALID [2018-11-18 22:53:02,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:02,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:02,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {469#false} is VALID [2018-11-18 22:53:02,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {469#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {469#false} is VALID [2018-11-18 22:53:02,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:02,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:02,964 INFO L273 TraceCheckUtils]: 23: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {469#false} is VALID [2018-11-18 22:53:02,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {469#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {469#false} is VALID [2018-11-18 22:53:02,965 INFO L273 TraceCheckUtils]: 26: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,965 INFO L273 TraceCheckUtils]: 27: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:02,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {469#false} havoc ~x~0;~x~0 := 0; {469#false} is VALID [2018-11-18 22:53:02,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:02,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {469#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {469#false} is VALID [2018-11-18 22:53:02,966 INFO L256 TraceCheckUtils]: 31: Hoare triple {469#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {469#false} is VALID [2018-11-18 22:53:02,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2018-11-18 22:53:02,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2018-11-18 22:53:02,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {469#false} assume !false; {469#false} is VALID [2018-11-18 22:53:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:53:02,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:02,970 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-18 22:53:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:03,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:03,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2018-11-18 22:53:03,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {468#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {468#true} is VALID [2018-11-18 22:53:03,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2018-11-18 22:53:03,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #95#return; {468#true} is VALID [2018-11-18 22:53:03,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret9 := main(); {468#true} is VALID [2018-11-18 22:53:03,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {468#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {490#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:03,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#(<= main_~i~0 0)} assume true; {490#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:03,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {471#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:03,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {471#(<= main_~i~0 1)} assume true; {471#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:03,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {471#(<= main_~i~0 1)} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:03,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:03,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {469#false} is VALID [2018-11-18 22:53:03,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {469#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {469#false} is VALID [2018-11-18 22:53:03,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:03,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:03,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {469#false} is VALID [2018-11-18 22:53:03,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {469#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {469#false} is VALID [2018-11-18 22:53:03,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:03,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {469#false} ~i~0 := 0; {469#false} is VALID [2018-11-18 22:53:03,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {469#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {469#false} is VALID [2018-11-18 22:53:03,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {469#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {469#false} is VALID [2018-11-18 22:53:03,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {469#false} assume !(~i~0 < 100000); {469#false} is VALID [2018-11-18 22:53:03,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {469#false} havoc ~x~0;~x~0 := 0; {469#false} is VALID [2018-11-18 22:53:03,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {469#false} assume true; {469#false} is VALID [2018-11-18 22:53:03,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {469#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {469#false} is VALID [2018-11-18 22:53:03,394 INFO L256 TraceCheckUtils]: 31: Hoare triple {469#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {469#false} is VALID [2018-11-18 22:53:03,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2018-11-18 22:53:03,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2018-11-18 22:53:03,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {469#false} assume !false; {469#false} is VALID [2018-11-18 22:53:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:53:03,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:03,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:53:03,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:53:03,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:03,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:53:03,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:03,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:53:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:53:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:53:03,629 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2018-11-18 22:53:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:04,047 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-11-18 22:53:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:53:04,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:53:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-18 22:53:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-18 22:53:04,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2018-11-18 22:53:04,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:04,186 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:53:04,187 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 22:53:04,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-18 22:53:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 22:53:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-18 22:53:04,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:04,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 51 states. [2018-11-18 22:53:04,244 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 51 states. [2018-11-18 22:53:04,244 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 51 states. [2018-11-18 22:53:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:04,249 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-18 22:53:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-18 22:53:04,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:04,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:04,250 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 54 states. [2018-11-18 22:53:04,250 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 54 states. [2018-11-18 22:53:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:04,254 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-18 22:53:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-18 22:53:04,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:04,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:04,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:04,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:53:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-18 22:53:04,259 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 35 [2018-11-18 22:53:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:04,259 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 22:53:04,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:53:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-18 22:53:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 22:53:04,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:04,261 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-18 22:53:04,262 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:04,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1666879863, now seen corresponding path program 2 times [2018-11-18 22:53:04,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:04,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:04,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:04,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:04,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {867#true} call ULTIMATE.init(); {867#true} is VALID [2018-11-18 22:53:04,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {867#true} is VALID [2018-11-18 22:53:04,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {867#true} {867#true} #95#return; {867#true} is VALID [2018-11-18 22:53:04,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {867#true} call #t~ret9 := main(); {867#true} is VALID [2018-11-18 22:53:04,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {869#(= main_~i~0 0)} is VALID [2018-11-18 22:53:04,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {869#(= main_~i~0 0)} assume true; {869#(= main_~i~0 0)} is VALID [2018-11-18 22:53:04,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {869#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {870#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:04,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {870#(<= main_~i~0 1)} assume true; {870#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:04,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {870#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {871#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:04,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {871#(<= main_~i~0 2)} assume true; {871#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:04,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {871#(<= main_~i~0 2)} assume !(~i~0 < 100000); {868#false} is VALID [2018-11-18 22:53:04,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {868#false} ~i~0 := 0; {868#false} is VALID [2018-11-18 22:53:04,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {868#false} is VALID [2018-11-18 22:53:04,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {868#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {868#false} is VALID [2018-11-18 22:53:04,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {868#false} is VALID [2018-11-18 22:53:04,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {868#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {868#false} is VALID [2018-11-18 22:53:04,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {868#false} assume !(~i~0 < 100000); {868#false} is VALID [2018-11-18 22:53:04,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {868#false} ~i~0 := 0; {868#false} is VALID [2018-11-18 22:53:04,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {868#false} is VALID [2018-11-18 22:53:04,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {868#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {868#false} is VALID [2018-11-18 22:53:04,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {868#false} is VALID [2018-11-18 22:53:04,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {868#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {868#false} is VALID [2018-11-18 22:53:04,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {868#false} assume !(~i~0 < 100000); {868#false} is VALID [2018-11-18 22:53:04,451 INFO L273 TraceCheckUtils]: 30: Hoare triple {868#false} ~i~0 := 0; {868#false} is VALID [2018-11-18 22:53:04,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,452 INFO L273 TraceCheckUtils]: 32: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {868#false} is VALID [2018-11-18 22:53:04,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {868#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {868#false} is VALID [2018-11-18 22:53:04,452 INFO L273 TraceCheckUtils]: 34: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {868#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {868#false} is VALID [2018-11-18 22:53:04,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {868#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {868#false} is VALID [2018-11-18 22:53:04,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {868#false} assume !(~i~0 < 100000); {868#false} is VALID [2018-11-18 22:53:04,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {868#false} havoc ~x~0;~x~0 := 0; {868#false} is VALID [2018-11-18 22:53:04,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {868#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {868#false} is VALID [2018-11-18 22:53:04,455 INFO L256 TraceCheckUtils]: 42: Hoare triple {868#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {868#false} is VALID [2018-11-18 22:53:04,455 INFO L273 TraceCheckUtils]: 43: Hoare triple {868#false} ~cond := #in~cond; {868#false} is VALID [2018-11-18 22:53:04,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {868#false} assume 0 == ~cond; {868#false} is VALID [2018-11-18 22:53:04,456 INFO L273 TraceCheckUtils]: 45: Hoare triple {868#false} assume !false; {868#false} is VALID [2018-11-18 22:53:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:53:04,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:04,459 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-18 22:53:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:04,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:04,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:04,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:04,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {867#true} call ULTIMATE.init(); {867#true} is VALID [2018-11-18 22:53:04,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {867#true} is VALID [2018-11-18 22:53:04,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {867#true} {867#true} #95#return; {867#true} is VALID [2018-11-18 22:53:04,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {867#true} call #t~ret9 := main(); {867#true} is VALID [2018-11-18 22:53:04,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {867#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {867#true} is VALID [2018-11-18 22:53:04,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {867#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {867#true} is VALID [2018-11-18 22:53:04,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {867#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {867#true} is VALID [2018-11-18 22:53:04,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#true} assume !(~i~0 < 100000); {867#true} is VALID [2018-11-18 22:53:04,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {867#true} ~i~0 := 0; {867#true} is VALID [2018-11-18 22:53:04,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {867#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {867#true} is VALID [2018-11-18 22:53:04,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {867#true} is VALID [2018-11-18 22:53:04,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {867#true} is VALID [2018-11-18 22:53:04,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {867#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {867#true} is VALID [2018-11-18 22:53:04,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#true} assume !(~i~0 < 100000); {867#true} is VALID [2018-11-18 22:53:04,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {867#true} ~i~0 := 0; {867#true} is VALID [2018-11-18 22:53:04,656 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {867#true} is VALID [2018-11-18 22:53:04,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {867#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {867#true} is VALID [2018-11-18 22:53:04,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {867#true} is VALID [2018-11-18 22:53:04,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {867#true} is VALID [2018-11-18 22:53:04,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-18 22:53:04,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {867#true} assume !(~i~0 < 100000); {867#true} is VALID [2018-11-18 22:53:04,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {867#true} ~i~0 := 0; {965#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:04,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {965#(<= main_~i~0 0)} assume true; {965#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:04,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {965#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {965#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:04,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {965#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {870#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:04,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {870#(<= main_~i~0 1)} assume true; {870#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:04,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {870#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {870#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:04,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {870#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {871#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:04,670 INFO L273 TraceCheckUtils]: 37: Hoare triple {871#(<= main_~i~0 2)} assume true; {871#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:04,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {871#(<= main_~i~0 2)} assume !(~i~0 < 100000); {868#false} is VALID [2018-11-18 22:53:04,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {868#false} havoc ~x~0;~x~0 := 0; {868#false} is VALID [2018-11-18 22:53:04,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {868#false} assume true; {868#false} is VALID [2018-11-18 22:53:04,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {868#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {868#false} is VALID [2018-11-18 22:53:04,672 INFO L256 TraceCheckUtils]: 42: Hoare triple {868#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {868#false} is VALID [2018-11-18 22:53:04,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {868#false} ~cond := #in~cond; {868#false} is VALID [2018-11-18 22:53:04,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {868#false} assume 0 == ~cond; {868#false} is VALID [2018-11-18 22:53:04,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {868#false} assume !false; {868#false} is VALID [2018-11-18 22:53:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 22:53:04,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:53:04,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 22:53:04,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:04,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:53:04,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:04,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:53:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:53:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:04,784 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-11-18 22:53:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:05,174 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-11-18 22:53:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:53:05,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 22:53:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2018-11-18 22:53:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2018-11-18 22:53:05,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 100 transitions. [2018-11-18 22:53:05,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:05,338 INFO L225 Difference]: With dead ends: 104 [2018-11-18 22:53:05,338 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 22:53:05,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 22:53:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-18 22:53:05,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:05,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2018-11-18 22:53:05,396 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2018-11-18 22:53:05,397 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2018-11-18 22:53:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:05,400 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-18 22:53:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-18 22:53:05,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:05,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:05,401 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2018-11-18 22:53:05,401 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2018-11-18 22:53:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:05,405 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-18 22:53:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-18 22:53:05,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:05,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:05,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:05,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:53:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-18 22:53:05,410 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 46 [2018-11-18 22:53:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:05,410 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-18 22:53:05,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:53:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 22:53:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 22:53:05,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:05,413 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-11-18 22:53:05,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:05,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash -754355071, now seen corresponding path program 3 times [2018-11-18 22:53:05,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:05,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:05,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {1364#true} call ULTIMATE.init(); {1364#true} is VALID [2018-11-18 22:53:05,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {1364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1364#true} is VALID [2018-11-18 22:53:05,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1364#true} {1364#true} #95#return; {1364#true} is VALID [2018-11-18 22:53:05,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {1364#true} call #t~ret9 := main(); {1364#true} is VALID [2018-11-18 22:53:05,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {1364#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1366#(= main_~i~0 0)} is VALID [2018-11-18 22:53:05,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {1366#(= main_~i~0 0)} assume true; {1366#(= main_~i~0 0)} is VALID [2018-11-18 22:53:05,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {1366#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1367#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:05,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {1367#(<= main_~i~0 1)} assume true; {1367#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:05,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {1367#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1368#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:05,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {1368#(<= main_~i~0 2)} assume true; {1368#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:05,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {1368#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1369#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:05,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {1369#(<= main_~i~0 3)} assume true; {1369#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:05,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {1369#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {1365#false} ~i~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1365#false} is VALID [2018-11-18 22:53:05,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {1365#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1365#false} is VALID [2018-11-18 22:53:05,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1365#false} is VALID [2018-11-18 22:53:05,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {1365#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1365#false} is VALID [2018-11-18 22:53:05,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1365#false} is VALID [2018-11-18 22:53:05,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {1365#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1365#false} is VALID [2018-11-18 22:53:05,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {1365#false} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {1365#false} ~i~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,581 INFO L273 TraceCheckUtils]: 33: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {1365#false} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {1365#false} ~i~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,583 INFO L273 TraceCheckUtils]: 41: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,585 INFO L273 TraceCheckUtils]: 48: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,585 INFO L273 TraceCheckUtils]: 49: Hoare triple {1365#false} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,585 INFO L273 TraceCheckUtils]: 50: Hoare triple {1365#false} havoc ~x~0;~x~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,586 INFO L273 TraceCheckUtils]: 52: Hoare triple {1365#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1365#false} is VALID [2018-11-18 22:53:05,586 INFO L256 TraceCheckUtils]: 53: Hoare triple {1365#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1365#false} is VALID [2018-11-18 22:53:05,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {1365#false} ~cond := #in~cond; {1365#false} is VALID [2018-11-18 22:53:05,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {1365#false} assume 0 == ~cond; {1365#false} is VALID [2018-11-18 22:53:05,587 INFO L273 TraceCheckUtils]: 56: Hoare triple {1365#false} assume !false; {1365#false} is VALID [2018-11-18 22:53:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:53:05,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:05,592 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-18 22:53:05,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:05,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:53:05,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:05,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:05,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {1364#true} call ULTIMATE.init(); {1364#true} is VALID [2018-11-18 22:53:05,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {1364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1364#true} is VALID [2018-11-18 22:53:05,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1364#true} {1364#true} #95#return; {1364#true} is VALID [2018-11-18 22:53:05,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {1364#true} call #t~ret9 := main(); {1364#true} is VALID [2018-11-18 22:53:05,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {1364#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1364#true} is VALID [2018-11-18 22:53:05,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {1364#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1364#true} is VALID [2018-11-18 22:53:05,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1364#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1364#true} is VALID [2018-11-18 22:53:05,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {1364#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1364#true} is VALID [2018-11-18 22:53:05,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-18 22:53:05,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {1364#true} assume !(~i~0 < 100000); {1364#true} is VALID [2018-11-18 22:53:05,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {1364#true} ~i~0 := 0; {1415#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:05,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {1415#(<= main_~i~0 0)} assume true; {1415#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:05,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {1415#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1415#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:05,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {1415#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1367#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:05,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#(<= main_~i~0 1)} assume true; {1367#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:05,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {1367#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1367#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:05,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {1367#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1368#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:05,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {1368#(<= main_~i~0 2)} assume true; {1368#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:05,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {1368#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1368#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:05,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {1368#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1369#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:05,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {1369#(<= main_~i~0 3)} assume true; {1369#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:05,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {1369#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {1365#false} ~i~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1365#false} is VALID [2018-11-18 22:53:05,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {1365#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1365#false} is VALID [2018-11-18 22:53:05,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {1365#false} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {1365#false} ~i~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,876 INFO L273 TraceCheckUtils]: 41: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {1365#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1365#false} is VALID [2018-11-18 22:53:05,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {1365#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1365#false} is VALID [2018-11-18 22:53:05,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,878 INFO L273 TraceCheckUtils]: 49: Hoare triple {1365#false} assume !(~i~0 < 100000); {1365#false} is VALID [2018-11-18 22:53:05,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {1365#false} havoc ~x~0;~x~0 := 0; {1365#false} is VALID [2018-11-18 22:53:05,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {1365#false} assume true; {1365#false} is VALID [2018-11-18 22:53:05,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {1365#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1365#false} is VALID [2018-11-18 22:53:05,879 INFO L256 TraceCheckUtils]: 53: Hoare triple {1365#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1365#false} is VALID [2018-11-18 22:53:05,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {1365#false} ~cond := #in~cond; {1365#false} is VALID [2018-11-18 22:53:05,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {1365#false} assume 0 == ~cond; {1365#false} is VALID [2018-11-18 22:53:05,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {1365#false} assume !false; {1365#false} is VALID [2018-11-18 22:53:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 22:53:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:05,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:53:05,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-18 22:53:05,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:05,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:53:05,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:05,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:53:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:53:05,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:53:05,972 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-11-18 22:53:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:06,307 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-11-18 22:53:06,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:53:06,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-18 22:53:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-18 22:53:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2018-11-18 22:53:06,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2018-11-18 22:53:06,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:06,592 INFO L225 Difference]: With dead ends: 124 [2018-11-18 22:53:06,593 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 22:53:06,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:53:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 22:53:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-11-18 22:53:06,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:06,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 73 states. [2018-11-18 22:53:06,632 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 73 states. [2018-11-18 22:53:06,632 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 73 states. [2018-11-18 22:53:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:06,636 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-18 22:53:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-18 22:53:06,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:06,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:06,637 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 76 states. [2018-11-18 22:53:06,637 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 76 states. [2018-11-18 22:53:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:06,641 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-18 22:53:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-18 22:53:06,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:06,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:06,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:06,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 22:53:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-18 22:53:06,645 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 57 [2018-11-18 22:53:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-18 22:53:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:53:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-18 22:53:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 22:53:06,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:06,648 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2018-11-18 22:53:06,648 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:06,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash -787604587, now seen corresponding path program 4 times [2018-11-18 22:53:06,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:06,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:06,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:06,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:06,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {1959#true} call ULTIMATE.init(); {1959#true} is VALID [2018-11-18 22:53:06,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {1959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1959#true} is VALID [2018-11-18 22:53:06,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:06,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1959#true} {1959#true} #95#return; {1959#true} is VALID [2018-11-18 22:53:06,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {1959#true} call #t~ret9 := main(); {1959#true} is VALID [2018-11-18 22:53:06,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {1959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1961#(= main_~i~0 0)} is VALID [2018-11-18 22:53:06,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {1961#(= main_~i~0 0)} assume true; {1961#(= main_~i~0 0)} is VALID [2018-11-18 22:53:06,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {1961#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1962#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:06,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {1962#(<= main_~i~0 1)} assume true; {1962#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:06,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {1962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1963#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:06,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {1963#(<= main_~i~0 2)} assume true; {1963#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:06,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {1963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1964#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:06,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {1964#(<= main_~i~0 3)} assume true; {1964#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:06,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {1964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1965#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:06,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {1965#(<= main_~i~0 4)} assume true; {1965#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:06,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {1965#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:06,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {1960#false} ~i~0 := 0; {1960#false} is VALID [2018-11-18 22:53:06,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1960#false} is VALID [2018-11-18 22:53:06,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {1960#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#false} is VALID [2018-11-18 22:53:06,895 INFO L273 TraceCheckUtils]: 20: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1960#false} is VALID [2018-11-18 22:53:06,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {1960#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#false} is VALID [2018-11-18 22:53:06,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1960#false} is VALID [2018-11-18 22:53:06,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {1960#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#false} is VALID [2018-11-18 22:53:06,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1960#false} is VALID [2018-11-18 22:53:06,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {1960#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#false} is VALID [2018-11-18 22:53:06,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {1960#false} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:06,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {1960#false} ~i~0 := 0; {1960#false} is VALID [2018-11-18 22:53:06,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:06,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:06,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:06,898 INFO L273 TraceCheckUtils]: 37: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:06,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:06,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:06,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:06,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:06,900 INFO L273 TraceCheckUtils]: 44: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {1960#false} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:06,901 INFO L273 TraceCheckUtils]: 46: Hoare triple {1960#false} ~i~0 := 0; {1960#false} is VALID [2018-11-18 22:53:06,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:06,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:06,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:06,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:06,902 INFO L273 TraceCheckUtils]: 53: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:06,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:06,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,904 INFO L273 TraceCheckUtils]: 57: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:06,904 INFO L273 TraceCheckUtils]: 58: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:06,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {1960#false} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:06,905 INFO L273 TraceCheckUtils]: 61: Hoare triple {1960#false} havoc ~x~0;~x~0 := 0; {1960#false} is VALID [2018-11-18 22:53:06,905 INFO L273 TraceCheckUtils]: 62: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:06,906 INFO L273 TraceCheckUtils]: 63: Hoare triple {1960#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1960#false} is VALID [2018-11-18 22:53:06,906 INFO L256 TraceCheckUtils]: 64: Hoare triple {1960#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1960#false} is VALID [2018-11-18 22:53:06,906 INFO L273 TraceCheckUtils]: 65: Hoare triple {1960#false} ~cond := #in~cond; {1960#false} is VALID [2018-11-18 22:53:06,906 INFO L273 TraceCheckUtils]: 66: Hoare triple {1960#false} assume 0 == ~cond; {1960#false} is VALID [2018-11-18 22:53:06,907 INFO L273 TraceCheckUtils]: 67: Hoare triple {1960#false} assume !false; {1960#false} is VALID [2018-11-18 22:53:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 22:53:06,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:06,910 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-18 22:53:06,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:06,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:06,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:07,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:07,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {1959#true} call ULTIMATE.init(); {1959#true} is VALID [2018-11-18 22:53:07,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {1959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1959#true} is VALID [2018-11-18 22:53:07,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1959#true} {1959#true} #95#return; {1959#true} is VALID [2018-11-18 22:53:07,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {1959#true} call #t~ret9 := main(); {1959#true} is VALID [2018-11-18 22:53:07,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {1959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1959#true} is VALID [2018-11-18 22:53:07,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {1959#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1959#true} is VALID [2018-11-18 22:53:07,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {1959#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1959#true} is VALID [2018-11-18 22:53:07,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {1959#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1959#true} is VALID [2018-11-18 22:53:07,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {1959#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1959#true} is VALID [2018-11-18 22:53:07,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {1959#true} assume true; {1959#true} is VALID [2018-11-18 22:53:07,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {1959#true} assume !(~i~0 < 100000); {1959#true} is VALID [2018-11-18 22:53:07,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {1959#true} ~i~0 := 0; {2017#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:07,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {2017#(<= main_~i~0 0)} assume true; {2017#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:07,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {2017#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2017#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:07,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {2017#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1962#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:07,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {1962#(<= main_~i~0 1)} assume true; {1962#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:07,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1962#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:07,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1962#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1963#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:07,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {1963#(<= main_~i~0 2)} assume true; {1963#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:07,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1963#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:07,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {1963#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1964#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:07,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {1964#(<= main_~i~0 3)} assume true; {1964#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:07,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {1964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1964#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:07,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {1964#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1965#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:07,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {1965#(<= main_~i~0 4)} assume true; {1965#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:07,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {1965#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:07,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {1960#false} ~i~0 := 0; {1960#false} is VALID [2018-11-18 22:53:07,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:07,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:07,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:07,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:07,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:07,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {1960#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {1960#false} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:07,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {1960#false} ~i~0 := 0; {1960#false} is VALID [2018-11-18 22:53:07,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,279 INFO L273 TraceCheckUtils]: 48: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:07,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:07,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:07,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:07,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:07,280 INFO L273 TraceCheckUtils]: 55: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:07,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {1960#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 58: Hoare triple {1960#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 59: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 60: Hoare triple {1960#false} assume !(~i~0 < 100000); {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 61: Hoare triple {1960#false} havoc ~x~0;~x~0 := 0; {1960#false} is VALID [2018-11-18 22:53:07,281 INFO L273 TraceCheckUtils]: 62: Hoare triple {1960#false} assume true; {1960#false} is VALID [2018-11-18 22:53:07,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {1960#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1960#false} is VALID [2018-11-18 22:53:07,282 INFO L256 TraceCheckUtils]: 64: Hoare triple {1960#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1960#false} is VALID [2018-11-18 22:53:07,282 INFO L273 TraceCheckUtils]: 65: Hoare triple {1960#false} ~cond := #in~cond; {1960#false} is VALID [2018-11-18 22:53:07,282 INFO L273 TraceCheckUtils]: 66: Hoare triple {1960#false} assume 0 == ~cond; {1960#false} is VALID [2018-11-18 22:53:07,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {1960#false} assume !false; {1960#false} is VALID [2018-11-18 22:53:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:53:07,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:07,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:53:07,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-18 22:53:07,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:07,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:53:07,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:07,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:53:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:53:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:53:07,367 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 8 states. [2018-11-18 22:53:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:08,025 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-11-18 22:53:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:53:08,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-18 22:53:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2018-11-18 22:53:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2018-11-18 22:53:08,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 122 transitions. [2018-11-18 22:53:08,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:08,276 INFO L225 Difference]: With dead ends: 144 [2018-11-18 22:53:08,276 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 22:53:08,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:53:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 22:53:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-11-18 22:53:08,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:08,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 84 states. [2018-11-18 22:53:08,473 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 84 states. [2018-11-18 22:53:08,473 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 84 states. [2018-11-18 22:53:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:08,476 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-18 22:53:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-18 22:53:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:08,477 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 87 states. [2018-11-18 22:53:08,477 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 87 states. [2018-11-18 22:53:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:08,480 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-18 22:53:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-18 22:53:08,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:08,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:08,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:08,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 22:53:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-11-18 22:53:08,485 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 68 [2018-11-18 22:53:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:08,485 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-11-18 22:53:08,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:53:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-18 22:53:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 22:53:08,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:08,486 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:08,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:08,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash -161138187, now seen corresponding path program 5 times [2018-11-18 22:53:08,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:08,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:08,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:09,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {2652#true} call ULTIMATE.init(); {2652#true} is VALID [2018-11-18 22:53:09,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {2652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2652#true} is VALID [2018-11-18 22:53:09,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:09,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2652#true} {2652#true} #95#return; {2652#true} is VALID [2018-11-18 22:53:09,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {2652#true} call #t~ret9 := main(); {2652#true} is VALID [2018-11-18 22:53:09,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {2652#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2654#(= main_~i~0 0)} is VALID [2018-11-18 22:53:09,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {2654#(= main_~i~0 0)} assume true; {2654#(= main_~i~0 0)} is VALID [2018-11-18 22:53:09,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {2654#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2655#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:09,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {2655#(<= main_~i~0 1)} assume true; {2655#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:09,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {2655#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2656#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:09,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {2656#(<= main_~i~0 2)} assume true; {2656#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:09,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {2656#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2657#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:09,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {2657#(<= main_~i~0 3)} assume true; {2657#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:09,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {2657#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2658#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:09,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {2658#(<= main_~i~0 4)} assume true; {2658#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:09,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {2658#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2659#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:09,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {2659#(<= main_~i~0 5)} assume true; {2659#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:09,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {2659#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:09,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {2653#false} ~i~0 := 0; {2653#false} is VALID [2018-11-18 22:53:09,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2653#false} is VALID [2018-11-18 22:53:09,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {2653#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2653#false} is VALID [2018-11-18 22:53:09,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2653#false} is VALID [2018-11-18 22:53:09,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {2653#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2653#false} is VALID [2018-11-18 22:53:09,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2653#false} is VALID [2018-11-18 22:53:09,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {2653#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2653#false} is VALID [2018-11-18 22:53:09,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2653#false} is VALID [2018-11-18 22:53:09,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {2653#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2653#false} is VALID [2018-11-18 22:53:09,206 INFO L273 TraceCheckUtils]: 31: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,206 INFO L273 TraceCheckUtils]: 32: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {2653#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 34: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 35: Hoare triple {2653#false} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {2653#false} ~i~0 := 0; {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:09,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:09,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,208 INFO L273 TraceCheckUtils]: 41: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:09,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:09,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:09,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:09,209 INFO L273 TraceCheckUtils]: 46: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:09,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:09,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:09,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:09,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {2653#false} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:09,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {2653#false} ~i~0 := 0; {2653#false} is VALID [2018-11-18 22:53:09,211 INFO L273 TraceCheckUtils]: 55: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:09,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:09,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:09,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:09,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,213 INFO L273 TraceCheckUtils]: 62: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:09,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:09,213 INFO L273 TraceCheckUtils]: 64: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,213 INFO L273 TraceCheckUtils]: 65: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:09,213 INFO L273 TraceCheckUtils]: 66: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:09,214 INFO L273 TraceCheckUtils]: 67: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {2653#false} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {2653#false} havoc ~x~0;~x~0 := 0; {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:09,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {2653#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2653#false} is VALID [2018-11-18 22:53:09,217 INFO L256 TraceCheckUtils]: 75: Hoare triple {2653#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2653#false} is VALID [2018-11-18 22:53:09,217 INFO L273 TraceCheckUtils]: 76: Hoare triple {2653#false} ~cond := #in~cond; {2653#false} is VALID [2018-11-18 22:53:09,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {2653#false} assume 0 == ~cond; {2653#false} is VALID [2018-11-18 22:53:09,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {2653#false} assume !false; {2653#false} is VALID [2018-11-18 22:53:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-18 22:53:09,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:09,221 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-18 22:53:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:53:10,710 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:53:10,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:10,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:10,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {2652#true} call ULTIMATE.init(); {2652#true} is VALID [2018-11-18 22:53:10,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {2652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2652#true} is VALID [2018-11-18 22:53:10,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,913 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2652#true} {2652#true} #95#return; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {2652#true} call #t~ret9 := main(); {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {2652#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {2652#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {2652#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {2652#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {2652#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {2652#true} assume true; {2652#true} is VALID [2018-11-18 22:53:10,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {2652#true} assume !(~i~0 < 100000); {2652#true} is VALID [2018-11-18 22:53:10,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {2652#true} ~i~0 := 0; {2717#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:10,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {2717#(<= main_~i~0 0)} assume true; {2717#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:10,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {2717#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2717#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:10,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {2717#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2655#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:10,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {2655#(<= main_~i~0 1)} assume true; {2655#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:10,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {2655#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2655#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:10,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {2655#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2656#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:10,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {2656#(<= main_~i~0 2)} assume true; {2656#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:10,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {2656#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2656#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:10,920 INFO L273 TraceCheckUtils]: 27: Hoare triple {2656#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2657#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:10,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {2657#(<= main_~i~0 3)} assume true; {2657#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:10,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {2657#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2657#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:10,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {2657#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2658#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:10,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {2658#(<= main_~i~0 4)} assume true; {2658#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:10,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {2658#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2658#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:10,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {2658#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2659#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:10,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {2659#(<= main_~i~0 5)} assume true; {2659#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:10,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {2659#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:10,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {2653#false} ~i~0 := 0; {2653#false} is VALID [2018-11-18 22:53:10,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:10,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:10,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:10,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:10,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:10,927 INFO L273 TraceCheckUtils]: 45: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 47: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 48: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 49: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 50: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 51: Hoare triple {2653#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#false} is VALID [2018-11-18 22:53:10,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 53: Hoare triple {2653#false} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 54: Hoare triple {2653#false} ~i~0 := 0; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 55: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 56: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:10,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 61: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 62: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 64: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 67: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,930 INFO L273 TraceCheckUtils]: 68: Hoare triple {2653#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 69: Hoare triple {2653#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 70: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 71: Hoare triple {2653#false} assume !(~i~0 < 100000); {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 72: Hoare triple {2653#false} havoc ~x~0;~x~0 := 0; {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {2653#false} assume true; {2653#false} is VALID [2018-11-18 22:53:10,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {2653#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2653#false} is VALID [2018-11-18 22:53:10,932 INFO L256 TraceCheckUtils]: 75: Hoare triple {2653#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2653#false} is VALID [2018-11-18 22:53:10,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {2653#false} ~cond := #in~cond; {2653#false} is VALID [2018-11-18 22:53:10,932 INFO L273 TraceCheckUtils]: 77: Hoare triple {2653#false} assume 0 == ~cond; {2653#false} is VALID [2018-11-18 22:53:10,932 INFO L273 TraceCheckUtils]: 78: Hoare triple {2653#false} assume !false; {2653#false} is VALID [2018-11-18 22:53:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 22:53:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:53:10,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-18 22:53:10,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:10,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:53:11,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:53:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:53:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:53:11,177 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 9 states. [2018-11-18 22:53:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:11,524 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-11-18 22:53:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:53:11,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-18 22:53:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2018-11-18 22:53:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2018-11-18 22:53:11,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 133 transitions. [2018-11-18 22:53:11,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:11,797 INFO L225 Difference]: With dead ends: 164 [2018-11-18 22:53:11,797 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 22:53:11,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:53:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 22:53:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2018-11-18 22:53:11,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:11,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 95 states. [2018-11-18 22:53:11,838 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 95 states. [2018-11-18 22:53:11,838 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 95 states. [2018-11-18 22:53:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:11,842 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-18 22:53:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-18 22:53:11,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:11,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:11,843 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 98 states. [2018-11-18 22:53:11,843 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 98 states. [2018-11-18 22:53:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:11,846 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-18 22:53:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-18 22:53:11,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:11,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:11,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:11,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:53:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-18 22:53:11,850 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 79 [2018-11-18 22:53:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:11,851 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-18 22:53:11,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:53:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-18 22:53:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:53:11,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:11,852 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2018-11-18 22:53:11,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:11,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1956494497, now seen corresponding path program 6 times [2018-11-18 22:53:11,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:11,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:11,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:12,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {3443#true} call ULTIMATE.init(); {3443#true} is VALID [2018-11-18 22:53:12,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {3443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3443#true} is VALID [2018-11-18 22:53:12,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:12,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3443#true} {3443#true} #95#return; {3443#true} is VALID [2018-11-18 22:53:12,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {3443#true} call #t~ret9 := main(); {3443#true} is VALID [2018-11-18 22:53:12,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {3443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3445#(= main_~i~0 0)} is VALID [2018-11-18 22:53:12,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {3445#(= main_~i~0 0)} assume true; {3445#(= main_~i~0 0)} is VALID [2018-11-18 22:53:12,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {3445#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3446#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:12,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {3446#(<= main_~i~0 1)} assume true; {3446#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:12,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {3446#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3447#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:12,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {3447#(<= main_~i~0 2)} assume true; {3447#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:12,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {3447#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3448#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:12,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(<= main_~i~0 3)} assume true; {3448#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:12,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {3448#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3449#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:12,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {3449#(<= main_~i~0 4)} assume true; {3449#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:12,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {3449#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3450#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:12,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {3450#(<= main_~i~0 5)} assume true; {3450#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:12,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {3450#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3451#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:12,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {3451#(<= main_~i~0 6)} assume true; {3451#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:12,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {3451#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3444#false} is VALID [2018-11-18 22:53:12,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {3444#false} ~i~0 := 0; {3444#false} is VALID [2018-11-18 22:53:12,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3444#false} is VALID [2018-11-18 22:53:12,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {3444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3444#false} is VALID [2018-11-18 22:53:12,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {3444#false} assume !(~i~0 < 100000); {3444#false} is VALID [2018-11-18 22:53:12,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {3444#false} ~i~0 := 0; {3444#false} is VALID [2018-11-18 22:53:12,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,046 INFO L273 TraceCheckUtils]: 45: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3444#false} is VALID [2018-11-18 22:53:12,049 INFO L273 TraceCheckUtils]: 59: Hoare triple {3444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3444#false} is VALID [2018-11-18 22:53:12,049 INFO L273 TraceCheckUtils]: 60: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {3444#false} assume !(~i~0 < 100000); {3444#false} is VALID [2018-11-18 22:53:12,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {3444#false} ~i~0 := 0; {3444#false} is VALID [2018-11-18 22:53:12,050 INFO L273 TraceCheckUtils]: 63: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,057 INFO L273 TraceCheckUtils]: 64: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,057 INFO L273 TraceCheckUtils]: 65: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,057 INFO L273 TraceCheckUtils]: 66: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,058 INFO L273 TraceCheckUtils]: 67: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,058 INFO L273 TraceCheckUtils]: 68: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,058 INFO L273 TraceCheckUtils]: 69: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 73: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 74: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 75: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 76: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,059 INFO L273 TraceCheckUtils]: 77: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 78: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 79: Hoare triple {3444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 80: Hoare triple {3444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 81: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 82: Hoare triple {3444#false} assume !(~i~0 < 100000); {3444#false} is VALID [2018-11-18 22:53:12,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {3444#false} havoc ~x~0;~x~0 := 0; {3444#false} is VALID [2018-11-18 22:53:12,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:12,061 INFO L273 TraceCheckUtils]: 85: Hoare triple {3444#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3444#false} is VALID [2018-11-18 22:53:12,061 INFO L256 TraceCheckUtils]: 86: Hoare triple {3444#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {3444#false} is VALID [2018-11-18 22:53:12,061 INFO L273 TraceCheckUtils]: 87: Hoare triple {3444#false} ~cond := #in~cond; {3444#false} is VALID [2018-11-18 22:53:12,061 INFO L273 TraceCheckUtils]: 88: Hoare triple {3444#false} assume 0 == ~cond; {3444#false} is VALID [2018-11-18 22:53:12,062 INFO L273 TraceCheckUtils]: 89: Hoare triple {3444#false} assume !false; {3444#false} is VALID [2018-11-18 22:53:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:53:12,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:12,066 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-18 22:53:12,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:53:12,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:53:12,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:12,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:13,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {3443#true} call ULTIMATE.init(); {3443#true} is VALID [2018-11-18 22:53:13,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {3443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3443#true} is VALID [2018-11-18 22:53:13,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3443#true} {3443#true} #95#return; {3443#true} is VALID [2018-11-18 22:53:13,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {3443#true} call #t~ret9 := main(); {3443#true} is VALID [2018-11-18 22:53:13,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {3443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3443#true} is VALID [2018-11-18 22:53:13,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {3443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {3443#true} assume !(~i~0 < 100000); {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {3443#true} ~i~0 := 0; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {3443#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {3443#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {3443#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {3443#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#true} is VALID [2018-11-18 22:53:13,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3443#true} is VALID [2018-11-18 22:53:13,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {3443#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#true} is VALID [2018-11-18 22:53:13,142 INFO L273 TraceCheckUtils]: 36: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3566#(< main_~i~0 100000)} is VALID [2018-11-18 22:53:13,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {3566#(< main_~i~0 100000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3570#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:13,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {3570#(<= main_~i~0 100000)} assume true; {3570#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:13,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {3570#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {3443#true} is VALID [2018-11-18 22:53:13,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {3443#true} ~i~0 := 0; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 47: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {3443#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3443#true} is VALID [2018-11-18 22:53:13,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {3443#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3443#true} is VALID [2018-11-18 22:53:13,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {3443#true} assume true; {3443#true} is VALID [2018-11-18 22:53:13,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {3443#true} assume !(~i~0 < 100000); {3443#true} is VALID [2018-11-18 22:53:13,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {3443#true} ~i~0 := 0; {3643#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:13,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {3643#(<= main_~i~0 0)} assume true; {3643#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:13,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {3643#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3643#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:13,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {3643#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3446#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:13,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {3446#(<= main_~i~0 1)} assume true; {3446#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:13,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {3446#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3446#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:13,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {3446#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3447#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:13,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {3447#(<= main_~i~0 2)} assume true; {3447#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:13,149 INFO L273 TraceCheckUtils]: 70: Hoare triple {3447#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3447#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:13,169 INFO L273 TraceCheckUtils]: 71: Hoare triple {3447#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3448#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:13,183 INFO L273 TraceCheckUtils]: 72: Hoare triple {3448#(<= main_~i~0 3)} assume true; {3448#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:13,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {3448#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3448#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:13,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {3448#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3449#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:13,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {3449#(<= main_~i~0 4)} assume true; {3449#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:13,230 INFO L273 TraceCheckUtils]: 76: Hoare triple {3449#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3449#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:13,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {3449#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3450#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:13,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {3450#(<= main_~i~0 5)} assume true; {3450#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:13,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {3450#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {3450#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:13,272 INFO L273 TraceCheckUtils]: 80: Hoare triple {3450#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3451#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:13,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {3451#(<= main_~i~0 6)} assume true; {3451#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:13,296 INFO L273 TraceCheckUtils]: 82: Hoare triple {3451#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3444#false} is VALID [2018-11-18 22:53:13,296 INFO L273 TraceCheckUtils]: 83: Hoare triple {3444#false} havoc ~x~0;~x~0 := 0; {3444#false} is VALID [2018-11-18 22:53:13,296 INFO L273 TraceCheckUtils]: 84: Hoare triple {3444#false} assume true; {3444#false} is VALID [2018-11-18 22:53:13,297 INFO L273 TraceCheckUtils]: 85: Hoare triple {3444#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3444#false} is VALID [2018-11-18 22:53:13,297 INFO L256 TraceCheckUtils]: 86: Hoare triple {3444#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {3444#false} is VALID [2018-11-18 22:53:13,297 INFO L273 TraceCheckUtils]: 87: Hoare triple {3444#false} ~cond := #in~cond; {3444#false} is VALID [2018-11-18 22:53:13,297 INFO L273 TraceCheckUtils]: 88: Hoare triple {3444#false} assume 0 == ~cond; {3444#false} is VALID [2018-11-18 22:53:13,297 INFO L273 TraceCheckUtils]: 89: Hoare triple {3444#false} assume !false; {3444#false} is VALID [2018-11-18 22:53:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 17 proven. 57 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-18 22:53:13,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:13,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2018-11-18 22:53:13,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-18 22:53:13,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:13,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:53:13,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:13,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:53:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:53:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:13,403 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 12 states. [2018-11-18 22:53:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:14,166 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2018-11-18 22:53:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:53:14,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-18 22:53:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2018-11-18 22:53:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2018-11-18 22:53:14,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 156 transitions. [2018-11-18 22:53:14,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:14,348 INFO L225 Difference]: With dead ends: 192 [2018-11-18 22:53:14,348 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 22:53:14,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 22:53:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-18 22:53:14,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:14,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2018-11-18 22:53:14,421 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 22:53:14,421 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 22:53:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:14,425 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-18 22:53:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:53:14,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:14,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:14,426 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 22:53:14,426 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 22:53:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:14,430 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-18 22:53:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:53:14,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:14,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:14,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 22:53:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-18 22:53:14,435 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 90 [2018-11-18 22:53:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:14,435 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-18 22:53:14,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:53:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 22:53:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 22:53:14,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:14,437 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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] [2018-11-18 22:53:14,437 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:14,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -123072083, now seen corresponding path program 7 times [2018-11-18 22:53:14,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:14,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:14,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:14,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:14,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {4377#true} call ULTIMATE.init(); {4377#true} is VALID [2018-11-18 22:53:14,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {4377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4377#true} is VALID [2018-11-18 22:53:14,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {4377#true} assume true; {4377#true} is VALID [2018-11-18 22:53:14,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4377#true} {4377#true} #95#return; {4377#true} is VALID [2018-11-18 22:53:14,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {4377#true} call #t~ret9 := main(); {4377#true} is VALID [2018-11-18 22:53:14,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {4377#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4379#(= main_~i~0 0)} is VALID [2018-11-18 22:53:14,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {4379#(= main_~i~0 0)} assume true; {4379#(= main_~i~0 0)} is VALID [2018-11-18 22:53:14,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {4379#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:14,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {4380#(<= main_~i~0 1)} assume true; {4380#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:14,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {4380#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:14,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {4381#(<= main_~i~0 2)} assume true; {4381#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:14,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {4381#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:14,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {4382#(<= main_~i~0 3)} assume true; {4382#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:14,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {4382#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4383#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:14,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(<= main_~i~0 4)} assume true; {4383#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:14,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {4383#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4384#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:14,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {4384#(<= main_~i~0 5)} assume true; {4384#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:14,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {4384#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4385#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:14,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= main_~i~0 6)} assume true; {4385#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:14,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4386#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:14,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {4386#(<= main_~i~0 7)} assume true; {4386#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:14,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {4386#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4387#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:14,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {4387#(<= main_~i~0 8)} assume true; {4387#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:14,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {4387#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:14,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:14,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 47: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:14,731 INFO L273 TraceCheckUtils]: 48: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:14,732 INFO L273 TraceCheckUtils]: 49: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,732 INFO L273 TraceCheckUtils]: 50: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:14,732 INFO L273 TraceCheckUtils]: 51: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:14,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 56: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 57: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 58: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 60: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 61: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 64: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,734 INFO L273 TraceCheckUtils]: 65: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 66: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 67: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 68: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,735 INFO L273 TraceCheckUtils]: 71: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 72: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 73: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 74: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 75: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 76: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,736 INFO L273 TraceCheckUtils]: 77: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 78: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 79: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 80: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 81: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 82: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,737 INFO L273 TraceCheckUtils]: 83: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 84: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 85: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 86: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 87: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 88: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 90: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 91: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 92: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 93: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 94: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,739 INFO L273 TraceCheckUtils]: 95: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 96: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 97: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 98: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 99: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 100: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,740 INFO L273 TraceCheckUtils]: 101: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 102: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 103: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 104: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 105: Hoare triple {4378#false} havoc ~x~0;~x~0 := 0; {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 106: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:14,741 INFO L273 TraceCheckUtils]: 107: Hoare triple {4378#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4378#false} is VALID [2018-11-18 22:53:14,742 INFO L256 TraceCheckUtils]: 108: Hoare triple {4378#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4378#false} is VALID [2018-11-18 22:53:14,742 INFO L273 TraceCheckUtils]: 109: Hoare triple {4378#false} ~cond := #in~cond; {4378#false} is VALID [2018-11-18 22:53:14,742 INFO L273 TraceCheckUtils]: 110: Hoare triple {4378#false} assume 0 == ~cond; {4378#false} is VALID [2018-11-18 22:53:14,742 INFO L273 TraceCheckUtils]: 111: Hoare triple {4378#false} assume !false; {4378#false} is VALID [2018-11-18 22:53:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 22:53:14,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:14,750 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-18 22:53:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:14,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:14,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {4377#true} call ULTIMATE.init(); {4377#true} is VALID [2018-11-18 22:53:14,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {4377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4377#true} is VALID [2018-11-18 22:53:14,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {4377#true} assume true; {4377#true} is VALID [2018-11-18 22:53:14,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4377#true} {4377#true} #95#return; {4377#true} is VALID [2018-11-18 22:53:14,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {4377#true} call #t~ret9 := main(); {4377#true} is VALID [2018-11-18 22:53:14,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {4377#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4406#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:14,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {4406#(<= main_~i~0 0)} assume true; {4406#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:14,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {4406#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:14,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {4380#(<= main_~i~0 1)} assume true; {4380#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:14,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {4380#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:14,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {4381#(<= main_~i~0 2)} assume true; {4381#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:14,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {4381#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:14,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {4382#(<= main_~i~0 3)} assume true; {4382#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:14,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {4382#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4383#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:14,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(<= main_~i~0 4)} assume true; {4383#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:14,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {4383#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4384#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:14,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {4384#(<= main_~i~0 5)} assume true; {4384#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:14,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {4384#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4385#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:14,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= main_~i~0 6)} assume true; {4385#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:14,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4386#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:14,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {4386#(<= main_~i~0 7)} assume true; {4386#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:14,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {4386#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4387#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:14,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {4387#(<= main_~i~0 8)} assume true; {4387#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:15,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {4387#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:15,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:15,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,002 INFO L273 TraceCheckUtils]: 34: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4378#false} is VALID [2018-11-18 22:53:15,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {4378#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4378#false} is VALID [2018-11-18 22:53:15,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:15,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:15,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,008 INFO L273 TraceCheckUtils]: 61: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,008 INFO L273 TraceCheckUtils]: 62: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,008 INFO L273 TraceCheckUtils]: 63: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,008 INFO L273 TraceCheckUtils]: 65: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,009 INFO L273 TraceCheckUtils]: 66: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,009 INFO L273 TraceCheckUtils]: 67: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,009 INFO L273 TraceCheckUtils]: 68: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,009 INFO L273 TraceCheckUtils]: 69: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,009 INFO L273 TraceCheckUtils]: 70: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,010 INFO L273 TraceCheckUtils]: 71: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,010 INFO L273 TraceCheckUtils]: 72: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,010 INFO L273 TraceCheckUtils]: 74: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4378#false} is VALID [2018-11-18 22:53:15,010 INFO L273 TraceCheckUtils]: 75: Hoare triple {4378#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4378#false} is VALID [2018-11-18 22:53:15,011 INFO L273 TraceCheckUtils]: 76: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:15,011 INFO L273 TraceCheckUtils]: 78: Hoare triple {4378#false} ~i~0 := 0; {4378#false} is VALID [2018-11-18 22:53:15,011 INFO L273 TraceCheckUtils]: 79: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,011 INFO L273 TraceCheckUtils]: 80: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,012 INFO L273 TraceCheckUtils]: 81: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,012 INFO L273 TraceCheckUtils]: 82: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,012 INFO L273 TraceCheckUtils]: 83: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,012 INFO L273 TraceCheckUtils]: 84: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,013 INFO L273 TraceCheckUtils]: 85: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,013 INFO L273 TraceCheckUtils]: 86: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,013 INFO L273 TraceCheckUtils]: 87: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,013 INFO L273 TraceCheckUtils]: 88: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,013 INFO L273 TraceCheckUtils]: 89: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,014 INFO L273 TraceCheckUtils]: 90: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,014 INFO L273 TraceCheckUtils]: 91: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,014 INFO L273 TraceCheckUtils]: 92: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,014 INFO L273 TraceCheckUtils]: 93: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,015 INFO L273 TraceCheckUtils]: 94: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,015 INFO L273 TraceCheckUtils]: 95: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,015 INFO L273 TraceCheckUtils]: 96: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,015 INFO L273 TraceCheckUtils]: 97: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,015 INFO L273 TraceCheckUtils]: 98: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,016 INFO L273 TraceCheckUtils]: 99: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,016 INFO L273 TraceCheckUtils]: 100: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,016 INFO L273 TraceCheckUtils]: 101: Hoare triple {4378#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {4378#false} is VALID [2018-11-18 22:53:15,016 INFO L273 TraceCheckUtils]: 102: Hoare triple {4378#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4378#false} is VALID [2018-11-18 22:53:15,016 INFO L273 TraceCheckUtils]: 103: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,017 INFO L273 TraceCheckUtils]: 104: Hoare triple {4378#false} assume !(~i~0 < 100000); {4378#false} is VALID [2018-11-18 22:53:15,017 INFO L273 TraceCheckUtils]: 105: Hoare triple {4378#false} havoc ~x~0;~x~0 := 0; {4378#false} is VALID [2018-11-18 22:53:15,017 INFO L273 TraceCheckUtils]: 106: Hoare triple {4378#false} assume true; {4378#false} is VALID [2018-11-18 22:53:15,017 INFO L273 TraceCheckUtils]: 107: Hoare triple {4378#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4378#false} is VALID [2018-11-18 22:53:15,018 INFO L256 TraceCheckUtils]: 108: Hoare triple {4378#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4378#false} is VALID [2018-11-18 22:53:15,018 INFO L273 TraceCheckUtils]: 109: Hoare triple {4378#false} ~cond := #in~cond; {4378#false} is VALID [2018-11-18 22:53:15,018 INFO L273 TraceCheckUtils]: 110: Hoare triple {4378#false} assume 0 == ~cond; {4378#false} is VALID [2018-11-18 22:53:15,018 INFO L273 TraceCheckUtils]: 111: Hoare triple {4378#false} assume !false; {4378#false} is VALID [2018-11-18 22:53:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 22:53:15,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:53:15,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2018-11-18 22:53:15,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:15,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:53:15,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:15,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:53:15,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:53:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:15,100 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 12 states. [2018-11-18 22:53:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:15,745 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-11-18 22:53:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:53:15,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2018-11-18 22:53:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2018-11-18 22:53:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2018-11-18 22:53:15,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 166 transitions. [2018-11-18 22:53:15,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:16,001 INFO L225 Difference]: With dead ends: 224 [2018-11-18 22:53:16,001 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 22:53:16,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 22:53:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-11-18 22:53:16,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:16,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 128 states. [2018-11-18 22:53:16,061 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 128 states. [2018-11-18 22:53:16,061 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 128 states. [2018-11-18 22:53:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:16,065 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-11-18 22:53:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-18 22:53:16,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:16,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:16,066 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 131 states. [2018-11-18 22:53:16,066 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 131 states. [2018-11-18 22:53:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:16,070 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-11-18 22:53:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-18 22:53:16,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:16,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:16,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:16,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:53:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-11-18 22:53:16,076 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 112 [2018-11-18 22:53:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:16,076 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-11-18 22:53:16,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:53:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-18 22:53:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 22:53:16,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:16,078 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:16,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:16,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 457263325, now seen corresponding path program 8 times [2018-11-18 22:53:16,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:16,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {5462#true} call ULTIMATE.init(); {5462#true} is VALID [2018-11-18 22:53:16,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {5462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5462#true} is VALID [2018-11-18 22:53:16,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {5462#true} assume true; {5462#true} is VALID [2018-11-18 22:53:16,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5462#true} {5462#true} #95#return; {5462#true} is VALID [2018-11-18 22:53:16,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {5462#true} call #t~ret9 := main(); {5462#true} is VALID [2018-11-18 22:53:16,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {5462#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5464#(= main_~i~0 0)} is VALID [2018-11-18 22:53:16,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {5464#(= main_~i~0 0)} assume true; {5464#(= main_~i~0 0)} is VALID [2018-11-18 22:53:16,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {5464#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5465#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:16,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {5465#(<= main_~i~0 1)} assume true; {5465#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:16,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {5465#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5466#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:16,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {5466#(<= main_~i~0 2)} assume true; {5466#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:16,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {5466#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5467#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:16,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {5467#(<= main_~i~0 3)} assume true; {5467#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:16,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {5467#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5468#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:16,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {5468#(<= main_~i~0 4)} assume true; {5468#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:16,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {5468#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5469#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:16,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(<= main_~i~0 5)} assume true; {5469#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:16,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {5469#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5470#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:16,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {5470#(<= main_~i~0 6)} assume true; {5470#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:16,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {5470#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5471#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:16,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {5471#(<= main_~i~0 7)} assume true; {5471#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:16,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {5471#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5472#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:16,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {5472#(<= main_~i~0 8)} assume true; {5472#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:16,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5473#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:16,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {5473#(<= main_~i~0 9)} assume true; {5473#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:16,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {5473#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,369 INFO L273 TraceCheckUtils]: 33: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,373 INFO L273 TraceCheckUtils]: 54: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 56: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,374 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 62: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 63: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 64: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 65: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,375 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 70: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 72: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 75: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 76: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 77: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 78: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,377 INFO L273 TraceCheckUtils]: 80: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 81: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 82: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 83: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 84: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,378 INFO L273 TraceCheckUtils]: 86: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 87: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 88: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 89: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 90: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 92: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,379 INFO L273 TraceCheckUtils]: 93: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 94: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 95: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 96: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 97: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 98: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,380 INFO L273 TraceCheckUtils]: 99: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 100: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 101: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 102: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 103: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 104: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 105: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,381 INFO L273 TraceCheckUtils]: 106: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 107: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 108: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 109: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 110: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 111: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,382 INFO L273 TraceCheckUtils]: 112: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 113: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 114: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 115: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 116: Hoare triple {5463#false} havoc ~x~0;~x~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 117: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L273 TraceCheckUtils]: 118: Hoare triple {5463#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5463#false} is VALID [2018-11-18 22:53:16,383 INFO L256 TraceCheckUtils]: 119: Hoare triple {5463#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {5463#false} is VALID [2018-11-18 22:53:16,384 INFO L273 TraceCheckUtils]: 120: Hoare triple {5463#false} ~cond := #in~cond; {5463#false} is VALID [2018-11-18 22:53:16,384 INFO L273 TraceCheckUtils]: 121: Hoare triple {5463#false} assume 0 == ~cond; {5463#false} is VALID [2018-11-18 22:53:16,384 INFO L273 TraceCheckUtils]: 122: Hoare triple {5463#false} assume !false; {5463#false} is VALID [2018-11-18 22:53:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-18 22:53:16,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:16,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:53:16,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:16,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:16,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:16,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:16,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {5462#true} call ULTIMATE.init(); {5462#true} is VALID [2018-11-18 22:53:16,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {5462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5462#true} is VALID [2018-11-18 22:53:16,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {5462#true} assume true; {5462#true} is VALID [2018-11-18 22:53:16,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5462#true} {5462#true} #95#return; {5462#true} is VALID [2018-11-18 22:53:16,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {5462#true} call #t~ret9 := main(); {5462#true} is VALID [2018-11-18 22:53:16,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {5462#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5492#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:16,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {5492#(<= main_~i~0 0)} assume true; {5492#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:16,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {5492#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5465#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:16,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {5465#(<= main_~i~0 1)} assume true; {5465#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:16,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {5465#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5466#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:16,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {5466#(<= main_~i~0 2)} assume true; {5466#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:16,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {5466#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5467#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:16,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {5467#(<= main_~i~0 3)} assume true; {5467#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:16,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {5467#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5468#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:16,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {5468#(<= main_~i~0 4)} assume true; {5468#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:16,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {5468#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5469#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:16,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(<= main_~i~0 5)} assume true; {5469#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:16,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {5469#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5470#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:16,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {5470#(<= main_~i~0 6)} assume true; {5470#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:16,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {5470#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5471#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:16,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {5471#(<= main_~i~0 7)} assume true; {5471#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:16,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {5471#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5472#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:16,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {5472#(<= main_~i~0 8)} assume true; {5472#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:16,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5473#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:16,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {5473#(<= main_~i~0 9)} assume true; {5473#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:16,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {5473#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 50: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {5463#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 54: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,883 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 58: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 59: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 60: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 62: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 64: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 66: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 70: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 71: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,885 INFO L273 TraceCheckUtils]: 72: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 76: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 77: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 78: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,886 INFO L273 TraceCheckUtils]: 80: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 81: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 82: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 83: Hoare triple {5463#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 84: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 86: Hoare triple {5463#false} ~i~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 87: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 88: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,887 INFO L273 TraceCheckUtils]: 89: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 90: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 91: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 92: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 93: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 94: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 95: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 96: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,888 INFO L273 TraceCheckUtils]: 97: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 98: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 99: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 100: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 101: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 102: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 103: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 104: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 105: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,889 INFO L273 TraceCheckUtils]: 106: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 108: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 109: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 110: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 111: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 112: Hoare triple {5463#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 113: Hoare triple {5463#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 114: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,890 INFO L273 TraceCheckUtils]: 115: Hoare triple {5463#false} assume !(~i~0 < 100000); {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 116: Hoare triple {5463#false} havoc ~x~0;~x~0 := 0; {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 117: Hoare triple {5463#false} assume true; {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 118: Hoare triple {5463#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L256 TraceCheckUtils]: 119: Hoare triple {5463#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 120: Hoare triple {5463#false} ~cond := #in~cond; {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 121: Hoare triple {5463#false} assume 0 == ~cond; {5463#false} is VALID [2018-11-18 22:53:16,891 INFO L273 TraceCheckUtils]: 122: Hoare triple {5463#false} assume !false; {5463#false} is VALID [2018-11-18 22:53:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-18 22:53:16,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:16,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:53:16,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-11-18 22:53:16,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:16,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:53:16,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:16,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:53:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:53:16,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:16,959 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 13 states. [2018-11-18 22:53:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:17,809 INFO L93 Difference]: Finished difference Result 244 states and 255 transitions. [2018-11-18 22:53:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:53:17,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-11-18 22:53:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-18 22:53:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-18 22:53:17,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 177 transitions. [2018-11-18 22:53:18,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:18,454 INFO L225 Difference]: With dead ends: 244 [2018-11-18 22:53:18,454 INFO L226 Difference]: Without dead ends: 142 [2018-11-18 22:53:18,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-18 22:53:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2018-11-18 22:53:18,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:18,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 139 states. [2018-11-18 22:53:18,516 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 139 states. [2018-11-18 22:53:18,516 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 139 states. [2018-11-18 22:53:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:18,520 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-18 22:53:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-18 22:53:18,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:18,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:18,521 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 142 states. [2018-11-18 22:53:18,521 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 142 states. [2018-11-18 22:53:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:18,524 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-18 22:53:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-18 22:53:18,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:18,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:18,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:18,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 22:53:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-18 22:53:18,529 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 123 [2018-11-18 22:53:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:18,529 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-18 22:53:18,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:53:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-18 22:53:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 22:53:18,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:18,531 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:18,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:18,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1107876537, now seen corresponding path program 9 times [2018-11-18 22:53:18,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:18,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:18,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:19,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {6645#true} call ULTIMATE.init(); {6645#true} is VALID [2018-11-18 22:53:19,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {6645#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6645#true} is VALID [2018-11-18 22:53:19,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:19,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6645#true} {6645#true} #95#return; {6645#true} is VALID [2018-11-18 22:53:19,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {6645#true} call #t~ret9 := main(); {6645#true} is VALID [2018-11-18 22:53:19,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {6645#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6647#(= main_~i~0 0)} is VALID [2018-11-18 22:53:19,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {6647#(= main_~i~0 0)} assume true; {6647#(= main_~i~0 0)} is VALID [2018-11-18 22:53:19,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {6647#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6648#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:19,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {6648#(<= main_~i~0 1)} assume true; {6648#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:19,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {6648#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6649#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:19,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {6649#(<= main_~i~0 2)} assume true; {6649#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:19,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {6649#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6650#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:19,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {6650#(<= main_~i~0 3)} assume true; {6650#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:19,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {6650#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6651#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:19,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {6651#(<= main_~i~0 4)} assume true; {6651#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:19,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {6651#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6652#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:19,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {6652#(<= main_~i~0 5)} assume true; {6652#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:19,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {6652#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6653#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:19,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {6653#(<= main_~i~0 6)} assume true; {6653#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:19,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {6653#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6654#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:19,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {6654#(<= main_~i~0 7)} assume true; {6654#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:19,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {6654#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6655#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:19,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {6655#(<= main_~i~0 8)} assume true; {6655#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:19,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {6655#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6656#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:19,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {6656#(<= main_~i~0 9)} assume true; {6656#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:19,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {6656#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6657#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:19,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {6657#(<= main_~i~0 10)} assume true; {6657#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:19,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {6657#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:19,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {6646#false} ~i~0 := 0; {6646#false} is VALID [2018-11-18 22:53:19,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 50: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 51: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 52: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 53: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,372 INFO L273 TraceCheckUtils]: 56: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,372 INFO L273 TraceCheckUtils]: 57: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6646#false} is VALID [2018-11-18 22:53:19,372 INFO L273 TraceCheckUtils]: 58: Hoare triple {6646#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6646#false} is VALID [2018-11-18 22:53:19,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,372 INFO L273 TraceCheckUtils]: 60: Hoare triple {6646#false} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 61: Hoare triple {6646#false} ~i~0 := 0; {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 62: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 63: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 68: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 69: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 70: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,374 INFO L273 TraceCheckUtils]: 72: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 73: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 74: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 75: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 76: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 77: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,375 INFO L273 TraceCheckUtils]: 78: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,376 INFO L273 TraceCheckUtils]: 79: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,376 INFO L273 TraceCheckUtils]: 80: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,376 INFO L273 TraceCheckUtils]: 81: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,376 INFO L273 TraceCheckUtils]: 82: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,376 INFO L273 TraceCheckUtils]: 83: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 84: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 85: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 86: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 87: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 88: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,377 INFO L273 TraceCheckUtils]: 89: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 90: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 91: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 92: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 93: Hoare triple {6646#false} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 94: Hoare triple {6646#false} ~i~0 := 0; {6646#false} is VALID [2018-11-18 22:53:19,378 INFO L273 TraceCheckUtils]: 95: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 96: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 97: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 98: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 99: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 100: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,379 INFO L273 TraceCheckUtils]: 101: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 102: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 103: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 104: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 105: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 106: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,380 INFO L273 TraceCheckUtils]: 107: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 108: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 109: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 110: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 111: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 112: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,381 INFO L273 TraceCheckUtils]: 113: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 114: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 115: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 116: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 117: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 118: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,382 INFO L273 TraceCheckUtils]: 119: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 120: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 121: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 122: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 123: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 124: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:19,383 INFO L273 TraceCheckUtils]: 125: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L273 TraceCheckUtils]: 126: Hoare triple {6646#false} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L273 TraceCheckUtils]: 127: Hoare triple {6646#false} havoc ~x~0;~x~0 := 0; {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L273 TraceCheckUtils]: 128: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L273 TraceCheckUtils]: 129: Hoare triple {6646#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L256 TraceCheckUtils]: 130: Hoare triple {6646#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {6646#false} is VALID [2018-11-18 22:53:19,384 INFO L273 TraceCheckUtils]: 131: Hoare triple {6646#false} ~cond := #in~cond; {6646#false} is VALID [2018-11-18 22:53:19,385 INFO L273 TraceCheckUtils]: 132: Hoare triple {6646#false} assume 0 == ~cond; {6646#false} is VALID [2018-11-18 22:53:19,385 INFO L273 TraceCheckUtils]: 133: Hoare triple {6646#false} assume !false; {6646#false} is VALID [2018-11-18 22:53:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-18 22:53:19,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:19,394 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-18 22:53:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:29,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 22:53:29,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:29,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:29,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {6645#true} call ULTIMATE.init(); {6645#true} is VALID [2018-11-18 22:53:29,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {6645#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6645#true} is VALID [2018-11-18 22:53:29,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6645#true} {6645#true} #95#return; {6645#true} is VALID [2018-11-18 22:53:29,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {6645#true} call #t~ret9 := main(); {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {6645#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6645#true} is VALID [2018-11-18 22:53:29,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {6645#true} assume true; {6645#true} is VALID [2018-11-18 22:53:29,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {6645#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6736#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:29,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {6736#(<= main_~i~0 100000)} assume true; {6736#(<= main_~i~0 100000)} is VALID [2018-11-18 22:53:29,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {6736#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6645#true} is VALID [2018-11-18 22:53:29,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {6645#true} ~i~0 := 0; {6746#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:29,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {6746#(<= main_~i~0 0)} assume true; {6746#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:29,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {6746#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6746#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:29,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {6746#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6648#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:29,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {6648#(<= main_~i~0 1)} assume true; {6648#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:29,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {6648#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6648#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:29,623 INFO L273 TraceCheckUtils]: 34: Hoare triple {6648#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6649#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:29,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {6649#(<= main_~i~0 2)} assume true; {6649#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:29,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {6649#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6649#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:29,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {6649#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6650#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:29,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {6650#(<= main_~i~0 3)} assume true; {6650#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:29,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {6650#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6650#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:29,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {6650#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6651#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:29,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {6651#(<= main_~i~0 4)} assume true; {6651#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:29,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {6651#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6651#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:29,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {6651#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6652#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:29,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {6652#(<= main_~i~0 5)} assume true; {6652#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:29,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {6652#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6652#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:29,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {6652#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6653#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:29,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {6653#(<= main_~i~0 6)} assume true; {6653#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:29,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {6653#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6653#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:29,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {6653#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6654#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:29,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {6654#(<= main_~i~0 7)} assume true; {6654#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:29,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {6654#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6654#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:29,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {6654#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6655#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:29,651 INFO L273 TraceCheckUtils]: 53: Hoare triple {6655#(<= main_~i~0 8)} assume true; {6655#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:29,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {6655#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6655#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:29,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {6655#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6656#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:29,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {6656#(<= main_~i~0 9)} assume true; {6656#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:29,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {6656#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6656#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:29,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {6656#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6657#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:29,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {6657#(<= main_~i~0 10)} assume true; {6657#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:29,655 INFO L273 TraceCheckUtils]: 60: Hoare triple {6657#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:29,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {6646#false} ~i~0 := 0; {6646#false} is VALID [2018-11-18 22:53:29,655 INFO L273 TraceCheckUtils]: 62: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,655 INFO L273 TraceCheckUtils]: 63: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,656 INFO L273 TraceCheckUtils]: 64: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,656 INFO L273 TraceCheckUtils]: 65: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,656 INFO L273 TraceCheckUtils]: 66: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,656 INFO L273 TraceCheckUtils]: 67: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,656 INFO L273 TraceCheckUtils]: 68: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,657 INFO L273 TraceCheckUtils]: 69: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,657 INFO L273 TraceCheckUtils]: 70: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,657 INFO L273 TraceCheckUtils]: 71: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,657 INFO L273 TraceCheckUtils]: 72: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,657 INFO L273 TraceCheckUtils]: 73: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 74: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 75: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 76: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 77: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 78: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,659 INFO L273 TraceCheckUtils]: 80: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,659 INFO L273 TraceCheckUtils]: 81: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,659 INFO L273 TraceCheckUtils]: 82: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,659 INFO L273 TraceCheckUtils]: 83: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 85: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 86: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 87: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 88: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 89: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 90: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6646#false} is VALID [2018-11-18 22:53:29,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {6646#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {6646#false} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 94: Hoare triple {6646#false} ~i~0 := 0; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 95: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 96: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 97: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 98: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,661 INFO L273 TraceCheckUtils]: 99: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 100: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 101: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 102: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 103: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 104: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 105: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 106: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 107: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,662 INFO L273 TraceCheckUtils]: 108: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 109: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 111: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 112: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 113: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 114: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 115: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,663 INFO L273 TraceCheckUtils]: 116: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 117: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 118: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 119: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 120: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 121: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 122: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 123: Hoare triple {6646#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 124: Hoare triple {6646#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6646#false} is VALID [2018-11-18 22:53:29,664 INFO L273 TraceCheckUtils]: 125: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 126: Hoare triple {6646#false} assume !(~i~0 < 100000); {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 127: Hoare triple {6646#false} havoc ~x~0;~x~0 := 0; {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 128: Hoare triple {6646#false} assume true; {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 129: Hoare triple {6646#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L256 TraceCheckUtils]: 130: Hoare triple {6646#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 131: Hoare triple {6646#false} ~cond := #in~cond; {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 132: Hoare triple {6646#false} assume 0 == ~cond; {6646#false} is VALID [2018-11-18 22:53:29,665 INFO L273 TraceCheckUtils]: 133: Hoare triple {6646#false} assume !false; {6646#false} is VALID [2018-11-18 22:53:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 20 proven. 155 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-18 22:53:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:29,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-11-18 22:53:29,697 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 134 [2018-11-18 22:53:29,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:29,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:53:29,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:29,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:53:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:53:29,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:53:29,776 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 15 states. [2018-11-18 22:53:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:30,467 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-11-18 22:53:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:53:30,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 134 [2018-11-18 22:53:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 206 transitions. [2018-11-18 22:53:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 206 transitions. [2018-11-18 22:53:30,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 206 transitions. [2018-11-18 22:53:30,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:30,717 INFO L225 Difference]: With dead ends: 278 [2018-11-18 22:53:30,717 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 22:53:30,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:53:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 22:53:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2018-11-18 22:53:30,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:30,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 150 states. [2018-11-18 22:53:30,886 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 150 states. [2018-11-18 22:53:30,886 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 150 states. [2018-11-18 22:53:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:30,890 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2018-11-18 22:53:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 175 transitions. [2018-11-18 22:53:30,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:30,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:30,891 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 167 states. [2018-11-18 22:53:30,892 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 167 states. [2018-11-18 22:53:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:30,896 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2018-11-18 22:53:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 175 transitions. [2018-11-18 22:53:30,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:30,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:30,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:30,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 22:53:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-11-18 22:53:30,901 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 134 [2018-11-18 22:53:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:30,901 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-11-18 22:53:30,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:53:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-18 22:53:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 22:53:30,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:30,903 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:30,903 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:30,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -598338991, now seen corresponding path program 10 times [2018-11-18 22:53:30,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:30,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:31,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {7974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7974#true} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:31,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #95#return; {7974#true} is VALID [2018-11-18 22:53:31,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret9 := main(); {7974#true} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {7974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7976#(= main_~i~0 0)} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {7976#(= main_~i~0 0)} assume true; {7976#(= main_~i~0 0)} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {7976#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {7977#(<= main_~i~0 1)} assume true; {7977#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {7977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7978#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {7978#(<= main_~i~0 2)} assume true; {7978#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {7978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7979#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {7979#(<= main_~i~0 3)} assume true; {7979#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {7979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7980#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:31,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {7980#(<= main_~i~0 4)} assume true; {7980#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:31,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {7980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7981#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:31,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {7981#(<= main_~i~0 5)} assume true; {7981#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:31,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {7981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7982#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:31,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {7982#(<= main_~i~0 6)} assume true; {7982#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:31,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {7982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7983#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:31,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {7983#(<= main_~i~0 7)} assume true; {7983#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:31,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {7983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7984#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:31,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {7984#(<= main_~i~0 8)} assume true; {7984#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:31,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {7984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7985#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:31,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#(<= main_~i~0 9)} assume true; {7985#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:31,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7986#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:31,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {7986#(<= main_~i~0 10)} assume true; {7986#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:31,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {7986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7987#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:31,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {7987#(<= main_~i~0 11)} assume true; {7987#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:31,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {7987#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7975#false} is VALID [2018-11-18 22:53:31,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {7975#false} ~i~0 := 0; {7975#false} is VALID [2018-11-18 22:53:31,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 47: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 59: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7975#false} is VALID [2018-11-18 22:53:31,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {7975#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {7975#false} assume !(~i~0 < 100000); {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {7975#false} ~i~0 := 0; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 94: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 95: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,624 INFO L273 TraceCheckUtils]: 96: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 97: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !(~i~0 < 100000); {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 102: Hoare triple {7975#false} ~i~0 := 0; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 103: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,625 INFO L273 TraceCheckUtils]: 104: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 105: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 106: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 109: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 110: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 111: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 112: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,626 INFO L273 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 115: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 118: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 119: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 120: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,627 INFO L273 TraceCheckUtils]: 121: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 124: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 125: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 126: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 127: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,628 INFO L273 TraceCheckUtils]: 130: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 131: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 132: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 133: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 135: Hoare triple {7975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 136: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 137: Hoare triple {7975#false} assume !(~i~0 < 100000); {7975#false} is VALID [2018-11-18 22:53:31,629 INFO L273 TraceCheckUtils]: 138: Hoare triple {7975#false} havoc ~x~0;~x~0 := 0; {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L273 TraceCheckUtils]: 139: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L273 TraceCheckUtils]: 140: Hoare triple {7975#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L256 TraceCheckUtils]: 141: Hoare triple {7975#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L273 TraceCheckUtils]: 142: Hoare triple {7975#false} ~cond := #in~cond; {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L273 TraceCheckUtils]: 143: Hoare triple {7975#false} assume 0 == ~cond; {7975#false} is VALID [2018-11-18 22:53:31,630 INFO L273 TraceCheckUtils]: 144: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2018-11-18 22:53:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-18 22:53:31,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:31,638 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-18 22:53:31,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:31,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:31,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:31,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:32,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2018-11-18 22:53:32,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {7974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7974#true} is VALID [2018-11-18 22:53:32,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #95#return; {7974#true} is VALID [2018-11-18 22:53:32,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret9 := main(); {7974#true} is VALID [2018-11-18 22:53:32,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {7974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7974#true} is VALID [2018-11-18 22:53:32,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {7974#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {7974#true} assume !(~i~0 < 100000); {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {7974#true} ~i~0 := 0; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,061 INFO L273 TraceCheckUtils]: 39: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 40: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 41: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 44: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,062 INFO L273 TraceCheckUtils]: 45: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 46: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 50: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,063 INFO L273 TraceCheckUtils]: 51: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 52: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 53: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 60: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7974#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {7974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 64: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {7974#true} assume !(~i~0 < 100000); {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 66: Hoare triple {7974#true} ~i~0 := 0; {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 67: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 68: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 69: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 72: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 73: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 74: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 75: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 76: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 77: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 78: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 79: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 80: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 82: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 83: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 84: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 85: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 86: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 87: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 88: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 89: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 90: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 91: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 92: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 93: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 94: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 95: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 96: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 97: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 98: Hoare triple {7974#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7974#true} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 99: Hoare triple {7974#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7974#true} is VALID [2018-11-18 22:53:32,072 INFO L273 TraceCheckUtils]: 100: Hoare triple {7974#true} assume true; {7974#true} is VALID [2018-11-18 22:53:32,072 INFO L273 TraceCheckUtils]: 101: Hoare triple {7974#true} assume !(~i~0 < 100000); {7974#true} is VALID [2018-11-18 22:53:32,085 INFO L273 TraceCheckUtils]: 102: Hoare triple {7974#true} ~i~0 := 0; {8297#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,098 INFO L273 TraceCheckUtils]: 103: Hoare triple {8297#(<= main_~i~0 0)} assume true; {8297#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,113 INFO L273 TraceCheckUtils]: 104: Hoare triple {8297#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {8297#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,122 INFO L273 TraceCheckUtils]: 105: Hoare triple {8297#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7977#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,123 INFO L273 TraceCheckUtils]: 106: Hoare triple {7977#(<= main_~i~0 1)} assume true; {7977#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,124 INFO L273 TraceCheckUtils]: 107: Hoare triple {7977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7977#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,129 INFO L273 TraceCheckUtils]: 108: Hoare triple {7977#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7978#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,131 INFO L273 TraceCheckUtils]: 109: Hoare triple {7978#(<= main_~i~0 2)} assume true; {7978#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,131 INFO L273 TraceCheckUtils]: 110: Hoare triple {7978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7978#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,132 INFO L273 TraceCheckUtils]: 111: Hoare triple {7978#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7979#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,132 INFO L273 TraceCheckUtils]: 112: Hoare triple {7979#(<= main_~i~0 3)} assume true; {7979#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,132 INFO L273 TraceCheckUtils]: 113: Hoare triple {7979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7979#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,133 INFO L273 TraceCheckUtils]: 114: Hoare triple {7979#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7980#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,133 INFO L273 TraceCheckUtils]: 115: Hoare triple {7980#(<= main_~i~0 4)} assume true; {7980#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,133 INFO L273 TraceCheckUtils]: 116: Hoare triple {7980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7980#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,134 INFO L273 TraceCheckUtils]: 117: Hoare triple {7980#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7981#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,134 INFO L273 TraceCheckUtils]: 118: Hoare triple {7981#(<= main_~i~0 5)} assume true; {7981#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,135 INFO L273 TraceCheckUtils]: 119: Hoare triple {7981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7981#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,136 INFO L273 TraceCheckUtils]: 120: Hoare triple {7981#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7982#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:32,136 INFO L273 TraceCheckUtils]: 121: Hoare triple {7982#(<= main_~i~0 6)} assume true; {7982#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:32,137 INFO L273 TraceCheckUtils]: 122: Hoare triple {7982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7982#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:32,137 INFO L273 TraceCheckUtils]: 123: Hoare triple {7982#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7983#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:32,138 INFO L273 TraceCheckUtils]: 124: Hoare triple {7983#(<= main_~i~0 7)} assume true; {7983#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:32,139 INFO L273 TraceCheckUtils]: 125: Hoare triple {7983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7983#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:32,139 INFO L273 TraceCheckUtils]: 126: Hoare triple {7983#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:32,140 INFO L273 TraceCheckUtils]: 127: Hoare triple {7984#(<= main_~i~0 8)} assume true; {7984#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:32,140 INFO L273 TraceCheckUtils]: 128: Hoare triple {7984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7984#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:32,141 INFO L273 TraceCheckUtils]: 129: Hoare triple {7984#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:32,142 INFO L273 TraceCheckUtils]: 130: Hoare triple {7985#(<= main_~i~0 9)} assume true; {7985#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:32,142 INFO L273 TraceCheckUtils]: 131: Hoare triple {7985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7985#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:32,143 INFO L273 TraceCheckUtils]: 132: Hoare triple {7985#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7986#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:32,143 INFO L273 TraceCheckUtils]: 133: Hoare triple {7986#(<= main_~i~0 10)} assume true; {7986#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:32,144 INFO L273 TraceCheckUtils]: 134: Hoare triple {7986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {7986#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:32,145 INFO L273 TraceCheckUtils]: 135: Hoare triple {7986#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7987#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:32,145 INFO L273 TraceCheckUtils]: 136: Hoare triple {7987#(<= main_~i~0 11)} assume true; {7987#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:32,146 INFO L273 TraceCheckUtils]: 137: Hoare triple {7987#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7975#false} is VALID [2018-11-18 22:53:32,146 INFO L273 TraceCheckUtils]: 138: Hoare triple {7975#false} havoc ~x~0;~x~0 := 0; {7975#false} is VALID [2018-11-18 22:53:32,146 INFO L273 TraceCheckUtils]: 139: Hoare triple {7975#false} assume true; {7975#false} is VALID [2018-11-18 22:53:32,147 INFO L273 TraceCheckUtils]: 140: Hoare triple {7975#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7975#false} is VALID [2018-11-18 22:53:32,147 INFO L256 TraceCheckUtils]: 141: Hoare triple {7975#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {7975#false} is VALID [2018-11-18 22:53:32,147 INFO L273 TraceCheckUtils]: 142: Hoare triple {7975#false} ~cond := #in~cond; {7975#false} is VALID [2018-11-18 22:53:32,147 INFO L273 TraceCheckUtils]: 143: Hoare triple {7975#false} assume 0 == ~cond; {7975#false} is VALID [2018-11-18 22:53:32,147 INFO L273 TraceCheckUtils]: 144: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2018-11-18 22:53:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 22:53:32,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:53:32,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2018-11-18 22:53:32,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:32,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:53:32,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:32,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:53:32,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:53:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:53:32,272 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 15 states. [2018-11-18 22:53:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:32,940 INFO L93 Difference]: Finished difference Result 284 states and 295 transitions. [2018-11-18 22:53:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:53:32,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2018-11-18 22:53:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2018-11-18 22:53:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2018-11-18 22:53:32,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 199 transitions. [2018-11-18 22:53:33,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:33,484 INFO L225 Difference]: With dead ends: 284 [2018-11-18 22:53:33,485 INFO L226 Difference]: Without dead ends: 164 [2018-11-18 22:53:33,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:53:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-18 22:53:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-11-18 22:53:33,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:33,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 161 states. [2018-11-18 22:53:33,552 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 161 states. [2018-11-18 22:53:33,553 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 161 states. [2018-11-18 22:53:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:33,557 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-11-18 22:53:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-18 22:53:33,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:33,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:33,558 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 164 states. [2018-11-18 22:53:33,558 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 164 states. [2018-11-18 22:53:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:33,563 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-11-18 22:53:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-18 22:53:33,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:33,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:33,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:33,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 22:53:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-18 22:53:33,568 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 145 [2018-11-18 22:53:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:33,569 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-18 22:53:33,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:53:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-18 22:53:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 22:53:33,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:33,571 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:33,571 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:33,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:33,572 INFO L82 PathProgramCache]: Analyzing trace with hash 353359813, now seen corresponding path program 11 times [2018-11-18 22:53:33,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:33,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:33,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:34,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {9353#true} call ULTIMATE.init(); {9353#true} is VALID [2018-11-18 22:53:34,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {9353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9353#true} is VALID [2018-11-18 22:53:34,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:53:34,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9353#true} {9353#true} #95#return; {9353#true} is VALID [2018-11-18 22:53:34,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {9353#true} call #t~ret9 := main(); {9353#true} is VALID [2018-11-18 22:53:34,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {9353#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9355#(= main_~i~0 0)} is VALID [2018-11-18 22:53:34,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {9355#(= main_~i~0 0)} assume true; {9355#(= main_~i~0 0)} is VALID [2018-11-18 22:53:34,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {9355#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9356#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {9356#(<= main_~i~0 1)} assume true; {9356#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {9356#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9357#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {9357#(<= main_~i~0 2)} assume true; {9357#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {9357#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9358#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {9358#(<= main_~i~0 3)} assume true; {9358#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {9358#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9359#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {9359#(<= main_~i~0 4)} assume true; {9359#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {9359#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9360#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {9360#(<= main_~i~0 5)} assume true; {9360#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {9360#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9361#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {9361#(<= main_~i~0 6)} assume true; {9361#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {9361#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9362#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {9362#(<= main_~i~0 7)} assume true; {9362#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {9362#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9363#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {9363#(<= main_~i~0 8)} assume true; {9363#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {9363#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9364#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:34,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {9364#(<= main_~i~0 9)} assume true; {9364#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:34,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {9364#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9365#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:34,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {9365#(<= main_~i~0 10)} assume true; {9365#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:34,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {9365#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9366#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:34,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {9366#(<= main_~i~0 11)} assume true; {9366#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:34,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {9366#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9367#(<= main_~i~0 12)} is VALID [2018-11-18 22:53:34,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {9367#(<= main_~i~0 12)} assume true; {9367#(<= main_~i~0 12)} is VALID [2018-11-18 22:53:34,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {9367#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9354#false} is VALID [2018-11-18 22:53:34,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {9354#false} ~i~0 := 0; {9354#false} is VALID [2018-11-18 22:53:34,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,412 INFO L273 TraceCheckUtils]: 59: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 61: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 62: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 63: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 64: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 65: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 66: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9354#false} is VALID [2018-11-18 22:53:34,413 INFO L273 TraceCheckUtils]: 68: Hoare triple {9354#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 69: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 70: Hoare triple {9354#false} assume !(~i~0 < 100000); {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 71: Hoare triple {9354#false} ~i~0 := 0; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 72: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 73: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 74: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 75: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,414 INFO L273 TraceCheckUtils]: 76: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 77: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 78: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 79: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 82: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 83: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,415 INFO L273 TraceCheckUtils]: 85: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 86: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 87: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 92: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 93: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,416 INFO L273 TraceCheckUtils]: 94: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 95: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 96: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 98: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 99: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 100: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 101: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,417 INFO L273 TraceCheckUtils]: 102: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 103: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 104: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 105: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 106: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 107: Hoare triple {9354#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 108: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 109: Hoare triple {9354#false} assume !(~i~0 < 100000); {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 110: Hoare triple {9354#false} ~i~0 := 0; {9354#false} is VALID [2018-11-18 22:53:34,418 INFO L273 TraceCheckUtils]: 111: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 112: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 113: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 114: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 115: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 116: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 117: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 118: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,419 INFO L273 TraceCheckUtils]: 119: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 120: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 121: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 122: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 123: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 124: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 125: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 126: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 127: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,420 INFO L273 TraceCheckUtils]: 128: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 129: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 130: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 131: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 132: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 133: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 134: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 135: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 136: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,421 INFO L273 TraceCheckUtils]: 137: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 138: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 139: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 140: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 141: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 142: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 143: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 144: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,422 INFO L273 TraceCheckUtils]: 145: Hoare triple {9354#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 146: Hoare triple {9354#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 147: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 148: Hoare triple {9354#false} assume !(~i~0 < 100000); {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 149: Hoare triple {9354#false} havoc ~x~0;~x~0 := 0; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 150: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 151: Hoare triple {9354#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L256 TraceCheckUtils]: 152: Hoare triple {9354#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 153: Hoare triple {9354#false} ~cond := #in~cond; {9354#false} is VALID [2018-11-18 22:53:34,423 INFO L273 TraceCheckUtils]: 154: Hoare triple {9354#false} assume 0 == ~cond; {9354#false} is VALID [2018-11-18 22:53:34,424 INFO L273 TraceCheckUtils]: 155: Hoare triple {9354#false} assume !false; {9354#false} is VALID [2018-11-18 22:53:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-11-18 22:53:34,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:34,433 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-18 22:53:34,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:54:49,745 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-18 22:54:49,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:49,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:50,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {9353#true} call ULTIMATE.init(); {9353#true} is VALID [2018-11-18 22:54:50,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {9353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9353#true} is VALID [2018-11-18 22:54:50,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9353#true} {9353#true} #95#return; {9353#true} is VALID [2018-11-18 22:54:50,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {9353#true} call #t~ret9 := main(); {9353#true} is VALID [2018-11-18 22:54:50,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {9353#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9353#true} is VALID [2018-11-18 22:54:50,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 23: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {9353#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {9353#true} assume !(~i~0 < 100000); {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {9353#true} ~i~0 := 0; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,069 INFO L273 TraceCheckUtils]: 35: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 54: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 56: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 57: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 62: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 63: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 64: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 66: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {9353#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9353#true} is VALID [2018-11-18 22:54:50,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 70: Hoare triple {9353#true} assume !(~i~0 < 100000); {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 71: Hoare triple {9353#true} ~i~0 := 0; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 72: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 73: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 76: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 77: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,074 INFO L273 TraceCheckUtils]: 78: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 79: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 80: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 83: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 86: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,075 INFO L273 TraceCheckUtils]: 87: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 88: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 89: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 90: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 91: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 92: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 93: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 96: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 97: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 98: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 99: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 100: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 101: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 102: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 103: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,077 INFO L273 TraceCheckUtils]: 104: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,078 INFO L273 TraceCheckUtils]: 105: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,078 INFO L273 TraceCheckUtils]: 106: Hoare triple {9353#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9353#true} is VALID [2018-11-18 22:54:50,078 INFO L273 TraceCheckUtils]: 107: Hoare triple {9353#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9353#true} is VALID [2018-11-18 22:54:50,078 INFO L273 TraceCheckUtils]: 108: Hoare triple {9353#true} assume true; {9353#true} is VALID [2018-11-18 22:54:50,078 INFO L273 TraceCheckUtils]: 109: Hoare triple {9353#true} assume !(~i~0 < 100000); {9353#true} is VALID [2018-11-18 22:54:50,079 INFO L273 TraceCheckUtils]: 110: Hoare triple {9353#true} ~i~0 := 0; {9701#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:50,079 INFO L273 TraceCheckUtils]: 111: Hoare triple {9701#(<= main_~i~0 0)} assume true; {9701#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:50,079 INFO L273 TraceCheckUtils]: 112: Hoare triple {9701#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9701#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:50,080 INFO L273 TraceCheckUtils]: 113: Hoare triple {9701#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9356#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:50,080 INFO L273 TraceCheckUtils]: 114: Hoare triple {9356#(<= main_~i~0 1)} assume true; {9356#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:50,080 INFO L273 TraceCheckUtils]: 115: Hoare triple {9356#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9356#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:50,081 INFO L273 TraceCheckUtils]: 116: Hoare triple {9356#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9357#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:50,081 INFO L273 TraceCheckUtils]: 117: Hoare triple {9357#(<= main_~i~0 2)} assume true; {9357#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:50,081 INFO L273 TraceCheckUtils]: 118: Hoare triple {9357#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9357#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:50,082 INFO L273 TraceCheckUtils]: 119: Hoare triple {9357#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9358#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:50,082 INFO L273 TraceCheckUtils]: 120: Hoare triple {9358#(<= main_~i~0 3)} assume true; {9358#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:50,083 INFO L273 TraceCheckUtils]: 121: Hoare triple {9358#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9358#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:50,083 INFO L273 TraceCheckUtils]: 122: Hoare triple {9358#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9359#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:50,084 INFO L273 TraceCheckUtils]: 123: Hoare triple {9359#(<= main_~i~0 4)} assume true; {9359#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:50,085 INFO L273 TraceCheckUtils]: 124: Hoare triple {9359#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9359#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:50,085 INFO L273 TraceCheckUtils]: 125: Hoare triple {9359#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9360#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:50,086 INFO L273 TraceCheckUtils]: 126: Hoare triple {9360#(<= main_~i~0 5)} assume true; {9360#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:50,086 INFO L273 TraceCheckUtils]: 127: Hoare triple {9360#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9360#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:50,087 INFO L273 TraceCheckUtils]: 128: Hoare triple {9360#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9361#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:50,088 INFO L273 TraceCheckUtils]: 129: Hoare triple {9361#(<= main_~i~0 6)} assume true; {9361#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:50,088 INFO L273 TraceCheckUtils]: 130: Hoare triple {9361#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9361#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:50,089 INFO L273 TraceCheckUtils]: 131: Hoare triple {9361#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9362#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:50,089 INFO L273 TraceCheckUtils]: 132: Hoare triple {9362#(<= main_~i~0 7)} assume true; {9362#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:50,090 INFO L273 TraceCheckUtils]: 133: Hoare triple {9362#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9362#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:50,091 INFO L273 TraceCheckUtils]: 134: Hoare triple {9362#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9363#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:50,091 INFO L273 TraceCheckUtils]: 135: Hoare triple {9363#(<= main_~i~0 8)} assume true; {9363#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:50,092 INFO L273 TraceCheckUtils]: 136: Hoare triple {9363#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9363#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:50,093 INFO L273 TraceCheckUtils]: 137: Hoare triple {9363#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9364#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:50,093 INFO L273 TraceCheckUtils]: 138: Hoare triple {9364#(<= main_~i~0 9)} assume true; {9364#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:50,094 INFO L273 TraceCheckUtils]: 139: Hoare triple {9364#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9364#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:50,094 INFO L273 TraceCheckUtils]: 140: Hoare triple {9364#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9365#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:50,095 INFO L273 TraceCheckUtils]: 141: Hoare triple {9365#(<= main_~i~0 10)} assume true; {9365#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:50,095 INFO L273 TraceCheckUtils]: 142: Hoare triple {9365#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9365#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:50,096 INFO L273 TraceCheckUtils]: 143: Hoare triple {9365#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9366#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:50,097 INFO L273 TraceCheckUtils]: 144: Hoare triple {9366#(<= main_~i~0 11)} assume true; {9366#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:50,097 INFO L273 TraceCheckUtils]: 145: Hoare triple {9366#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {9366#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:50,098 INFO L273 TraceCheckUtils]: 146: Hoare triple {9366#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9367#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:50,099 INFO L273 TraceCheckUtils]: 147: Hoare triple {9367#(<= main_~i~0 12)} assume true; {9367#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:50,099 INFO L273 TraceCheckUtils]: 148: Hoare triple {9367#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9354#false} is VALID [2018-11-18 22:54:50,100 INFO L273 TraceCheckUtils]: 149: Hoare triple {9354#false} havoc ~x~0;~x~0 := 0; {9354#false} is VALID [2018-11-18 22:54:50,100 INFO L273 TraceCheckUtils]: 150: Hoare triple {9354#false} assume true; {9354#false} is VALID [2018-11-18 22:54:50,100 INFO L273 TraceCheckUtils]: 151: Hoare triple {9354#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9354#false} is VALID [2018-11-18 22:54:50,100 INFO L256 TraceCheckUtils]: 152: Hoare triple {9354#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {9354#false} is VALID [2018-11-18 22:54:50,100 INFO L273 TraceCheckUtils]: 153: Hoare triple {9354#false} ~cond := #in~cond; {9354#false} is VALID [2018-11-18 22:54:50,101 INFO L273 TraceCheckUtils]: 154: Hoare triple {9354#false} assume 0 == ~cond; {9354#false} is VALID [2018-11-18 22:54:50,101 INFO L273 TraceCheckUtils]: 155: Hoare triple {9354#false} assume !false; {9354#false} is VALID [2018-11-18 22:54:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-18 22:54:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:54:50,145 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2018-11-18 22:54:50,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:50,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:54:50,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:50,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:54:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:54:50,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:54:50,245 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 16 states. [2018-11-18 22:54:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:51,317 INFO L93 Difference]: Finished difference Result 304 states and 315 transitions. [2018-11-18 22:54:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:54:51,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2018-11-18 22:54:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:54:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 210 transitions. [2018-11-18 22:54:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:54:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 210 transitions. [2018-11-18 22:54:51,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 210 transitions. [2018-11-18 22:54:52,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:52,020 INFO L225 Difference]: With dead ends: 304 [2018-11-18 22:54:52,021 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 22:54:52,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:54:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 22:54:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-11-18 22:54:52,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:52,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 172 states. [2018-11-18 22:54:52,085 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 172 states. [2018-11-18 22:54:52,086 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 172 states. [2018-11-18 22:54:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:52,091 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-11-18 22:54:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2018-11-18 22:54:52,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:52,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:52,092 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 175 states. [2018-11-18 22:54:52,092 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 175 states. [2018-11-18 22:54:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:52,096 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-11-18 22:54:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2018-11-18 22:54:52,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:52,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:52,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:52,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 22:54:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2018-11-18 22:54:52,100 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 156 [2018-11-18 22:54:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:52,101 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2018-11-18 22:54:52,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:54:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2018-11-18 22:54:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 22:54:52,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:52,102 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:52,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:52,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash -440596539, now seen corresponding path program 12 times [2018-11-18 22:54:52,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:52,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:52,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:52,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10830#true} is VALID [2018-11-18 22:54:52,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {10830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10830#true} is VALID [2018-11-18 22:54:52,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:54:52,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10830#true} {10830#true} #95#return; {10830#true} is VALID [2018-11-18 22:54:52,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {10830#true} call #t~ret9 := main(); {10830#true} is VALID [2018-11-18 22:54:52,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {10830#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10832#(= main_~i~0 0)} is VALID [2018-11-18 22:54:52,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {10832#(= main_~i~0 0)} assume true; {10832#(= main_~i~0 0)} is VALID [2018-11-18 22:54:52,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {10832#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10833#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:52,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {10833#(<= main_~i~0 1)} assume true; {10833#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:52,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {10833#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10834#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:52,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {10834#(<= main_~i~0 2)} assume true; {10834#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:52,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {10834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10835#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:52,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {10835#(<= main_~i~0 3)} assume true; {10835#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:52,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {10835#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10836#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:52,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {10836#(<= main_~i~0 4)} assume true; {10836#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:52,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {10836#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10837#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:52,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {10837#(<= main_~i~0 5)} assume true; {10837#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:52,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {10837#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10838#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:52,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {10838#(<= main_~i~0 6)} assume true; {10838#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:52,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {10838#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10839#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:52,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {10839#(<= main_~i~0 7)} assume true; {10839#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:52,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {10839#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10840#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:52,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {10840#(<= main_~i~0 8)} assume true; {10840#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:52,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {10840#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10841#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:52,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {10841#(<= main_~i~0 9)} assume true; {10841#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:52,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {10841#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10842#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:52,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {10842#(<= main_~i~0 10)} assume true; {10842#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:52,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {10842#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10843#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:52,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {10843#(<= main_~i~0 11)} assume true; {10843#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:52,472 INFO L273 TraceCheckUtils]: 29: Hoare triple {10843#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10844#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:52,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {10844#(<= main_~i~0 12)} assume true; {10844#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:52,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {10844#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:52,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {10845#(<= main_~i~0 13)} assume true; {10845#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:52,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {10845#(<= main_~i~0 13)} assume !(~i~0 < 100000); {10831#false} is VALID [2018-11-18 22:54:52,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {10831#false} ~i~0 := 0; {10831#false} is VALID [2018-11-18 22:54:52,475 INFO L273 TraceCheckUtils]: 35: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 56: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 60: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 67: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 68: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,480 INFO L273 TraceCheckUtils]: 69: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 73: Hoare triple {10831#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 74: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 75: Hoare triple {10831#false} assume !(~i~0 < 100000); {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 76: Hoare triple {10831#false} ~i~0 := 0; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 77: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,481 INFO L273 TraceCheckUtils]: 78: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 79: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 83: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 86: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 90: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 91: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 92: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 93: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 94: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 95: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,483 INFO L273 TraceCheckUtils]: 96: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 99: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 100: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 106: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 107: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 108: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 109: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 110: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 111: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 112: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 114: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {10831#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 117: Hoare triple {10831#false} assume !(~i~0 < 100000); {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 118: Hoare triple {10831#false} ~i~0 := 0; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 119: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 123: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 124: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 125: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 126: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 127: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 128: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 129: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,487 INFO L273 TraceCheckUtils]: 130: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 131: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 132: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 133: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 134: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 135: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 136: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 137: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 138: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,488 INFO L273 TraceCheckUtils]: 139: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 140: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 141: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 142: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 143: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 144: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 145: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 146: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 147: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,489 INFO L273 TraceCheckUtils]: 148: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 149: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 150: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 151: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 152: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 153: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 154: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 155: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 156: Hoare triple {10831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10831#false} is VALID [2018-11-18 22:54:52,490 INFO L273 TraceCheckUtils]: 157: Hoare triple {10831#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 158: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 159: Hoare triple {10831#false} assume !(~i~0 < 100000); {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 160: Hoare triple {10831#false} havoc ~x~0;~x~0 := 0; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 161: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 162: Hoare triple {10831#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L256 TraceCheckUtils]: 163: Hoare triple {10831#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 164: Hoare triple {10831#false} ~cond := #in~cond; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 165: Hoare triple {10831#false} assume 0 == ~cond; {10831#false} is VALID [2018-11-18 22:54:52,491 INFO L273 TraceCheckUtils]: 166: Hoare triple {10831#false} assume !false; {10831#false} is VALID [2018-11-18 22:54:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-18 22:54:52,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:52,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:54:52,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:55:52,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-18 22:55:52,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:52,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:52,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10830#true} is VALID [2018-11-18 22:55:52,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {10830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10830#true} is VALID [2018-11-18 22:55:52,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10830#true} {10830#true} #95#return; {10830#true} is VALID [2018-11-18 22:55:52,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {10830#true} call #t~ret9 := main(); {10830#true} is VALID [2018-11-18 22:55:52,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {10830#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10830#true} is VALID [2018-11-18 22:55:52,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#true} is VALID [2018-11-18 22:55:52,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {10830#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {10942#(<= main_~i~0 100000)} assume true; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,894 INFO L273 TraceCheckUtils]: 33: Hoare triple {10942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 34: Hoare triple {10830#true} ~i~0 := 0; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 35: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 38: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 39: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 43: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 46: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,896 INFO L273 TraceCheckUtils]: 51: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 54: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 57: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,898 INFO L273 TraceCheckUtils]: 69: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10830#true} is VALID [2018-11-18 22:55:52,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {10830#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10830#true} is VALID [2018-11-18 22:55:52,899 INFO L273 TraceCheckUtils]: 71: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,899 INFO L273 TraceCheckUtils]: 72: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11066#(< main_~i~0 100000)} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {11066#(< main_~i~0 100000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {10942#(<= main_~i~0 100000)} assume true; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {10942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {10830#true} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {10830#true} ~i~0 := 0; {10830#true} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 77: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,900 INFO L273 TraceCheckUtils]: 78: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 81: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 83: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 84: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 85: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 86: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,901 INFO L273 TraceCheckUtils]: 87: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 88: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 89: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 90: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 91: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 92: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 93: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 94: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 95: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,902 INFO L273 TraceCheckUtils]: 96: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 97: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 98: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 99: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 100: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 101: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 102: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 103: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 104: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,903 INFO L273 TraceCheckUtils]: 105: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 106: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 107: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 108: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 109: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 110: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 111: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 112: Hoare triple {10830#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10830#true} is VALID [2018-11-18 22:55:52,904 INFO L273 TraceCheckUtils]: 113: Hoare triple {10830#true} assume true; {10830#true} is VALID [2018-11-18 22:55:52,905 INFO L273 TraceCheckUtils]: 114: Hoare triple {10830#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11066#(< main_~i~0 100000)} is VALID [2018-11-18 22:55:52,905 INFO L273 TraceCheckUtils]: 115: Hoare triple {11066#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,906 INFO L273 TraceCheckUtils]: 116: Hoare triple {10942#(<= main_~i~0 100000)} assume true; {10942#(<= main_~i~0 100000)} is VALID [2018-11-18 22:55:52,906 INFO L273 TraceCheckUtils]: 117: Hoare triple {10942#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {10830#true} is VALID [2018-11-18 22:55:52,906 INFO L273 TraceCheckUtils]: 118: Hoare triple {10830#true} ~i~0 := 0; {11205#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:52,906 INFO L273 TraceCheckUtils]: 119: Hoare triple {11205#(<= main_~i~0 0)} assume true; {11205#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:52,907 INFO L273 TraceCheckUtils]: 120: Hoare triple {11205#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {11205#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:52,907 INFO L273 TraceCheckUtils]: 121: Hoare triple {11205#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10833#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:52,907 INFO L273 TraceCheckUtils]: 122: Hoare triple {10833#(<= main_~i~0 1)} assume true; {10833#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:52,908 INFO L273 TraceCheckUtils]: 123: Hoare triple {10833#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10833#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:52,908 INFO L273 TraceCheckUtils]: 124: Hoare triple {10833#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10834#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:52,909 INFO L273 TraceCheckUtils]: 125: Hoare triple {10834#(<= main_~i~0 2)} assume true; {10834#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:52,909 INFO L273 TraceCheckUtils]: 126: Hoare triple {10834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10834#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:52,910 INFO L273 TraceCheckUtils]: 127: Hoare triple {10834#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10835#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:52,910 INFO L273 TraceCheckUtils]: 128: Hoare triple {10835#(<= main_~i~0 3)} assume true; {10835#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:52,911 INFO L273 TraceCheckUtils]: 129: Hoare triple {10835#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10835#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:52,911 INFO L273 TraceCheckUtils]: 130: Hoare triple {10835#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10836#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:52,912 INFO L273 TraceCheckUtils]: 131: Hoare triple {10836#(<= main_~i~0 4)} assume true; {10836#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:52,913 INFO L273 TraceCheckUtils]: 132: Hoare triple {10836#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10836#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:52,913 INFO L273 TraceCheckUtils]: 133: Hoare triple {10836#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10837#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:52,914 INFO L273 TraceCheckUtils]: 134: Hoare triple {10837#(<= main_~i~0 5)} assume true; {10837#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:52,914 INFO L273 TraceCheckUtils]: 135: Hoare triple {10837#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10837#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:52,915 INFO L273 TraceCheckUtils]: 136: Hoare triple {10837#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10838#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:52,916 INFO L273 TraceCheckUtils]: 137: Hoare triple {10838#(<= main_~i~0 6)} assume true; {10838#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:52,916 INFO L273 TraceCheckUtils]: 138: Hoare triple {10838#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10838#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:52,917 INFO L273 TraceCheckUtils]: 139: Hoare triple {10838#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10839#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:52,917 INFO L273 TraceCheckUtils]: 140: Hoare triple {10839#(<= main_~i~0 7)} assume true; {10839#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:52,918 INFO L273 TraceCheckUtils]: 141: Hoare triple {10839#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10839#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:52,919 INFO L273 TraceCheckUtils]: 142: Hoare triple {10839#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10840#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:52,919 INFO L273 TraceCheckUtils]: 143: Hoare triple {10840#(<= main_~i~0 8)} assume true; {10840#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:52,920 INFO L273 TraceCheckUtils]: 144: Hoare triple {10840#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10840#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:52,921 INFO L273 TraceCheckUtils]: 145: Hoare triple {10840#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10841#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:52,921 INFO L273 TraceCheckUtils]: 146: Hoare triple {10841#(<= main_~i~0 9)} assume true; {10841#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:52,922 INFO L273 TraceCheckUtils]: 147: Hoare triple {10841#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10841#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:52,922 INFO L273 TraceCheckUtils]: 148: Hoare triple {10841#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10842#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:52,923 INFO L273 TraceCheckUtils]: 149: Hoare triple {10842#(<= main_~i~0 10)} assume true; {10842#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:52,923 INFO L273 TraceCheckUtils]: 150: Hoare triple {10842#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10842#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:52,924 INFO L273 TraceCheckUtils]: 151: Hoare triple {10842#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10843#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:52,925 INFO L273 TraceCheckUtils]: 152: Hoare triple {10843#(<= main_~i~0 11)} assume true; {10843#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:52,925 INFO L273 TraceCheckUtils]: 153: Hoare triple {10843#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10843#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:52,926 INFO L273 TraceCheckUtils]: 154: Hoare triple {10843#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10844#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:52,927 INFO L273 TraceCheckUtils]: 155: Hoare triple {10844#(<= main_~i~0 12)} assume true; {10844#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:52,927 INFO L273 TraceCheckUtils]: 156: Hoare triple {10844#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {10844#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:52,928 INFO L273 TraceCheckUtils]: 157: Hoare triple {10844#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10845#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:52,928 INFO L273 TraceCheckUtils]: 158: Hoare triple {10845#(<= main_~i~0 13)} assume true; {10845#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:52,929 INFO L273 TraceCheckUtils]: 159: Hoare triple {10845#(<= main_~i~0 13)} assume !(~i~0 < 100000); {10831#false} is VALID [2018-11-18 22:55:52,929 INFO L273 TraceCheckUtils]: 160: Hoare triple {10831#false} havoc ~x~0;~x~0 := 0; {10831#false} is VALID [2018-11-18 22:55:52,930 INFO L273 TraceCheckUtils]: 161: Hoare triple {10831#false} assume true; {10831#false} is VALID [2018-11-18 22:55:52,930 INFO L273 TraceCheckUtils]: 162: Hoare triple {10831#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10831#false} is VALID [2018-11-18 22:55:52,930 INFO L256 TraceCheckUtils]: 163: Hoare triple {10831#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {10831#false} is VALID [2018-11-18 22:55:52,930 INFO L273 TraceCheckUtils]: 164: Hoare triple {10831#false} ~cond := #in~cond; {10831#false} is VALID [2018-11-18 22:55:52,930 INFO L273 TraceCheckUtils]: 165: Hoare triple {10831#false} assume 0 == ~cond; {10831#false} is VALID [2018-11-18 22:55:52,931 INFO L273 TraceCheckUtils]: 166: Hoare triple {10831#false} assume !false; {10831#false} is VALID [2018-11-18 22:55:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 102 proven. 260 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-18 22:55:52,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:52,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 19 [2018-11-18 22:55:52,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 167 [2018-11-18 22:55:52,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:52,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:55:53,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:53,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:55:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:55:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:53,082 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 19 states. [2018-11-18 22:55:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:54,790 INFO L93 Difference]: Finished difference Result 332 states and 347 transitions. [2018-11-18 22:55:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:55:54,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 167 [2018-11-18 22:55:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2018-11-18 22:55:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2018-11-18 22:55:54,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 233 transitions. [2018-11-18 22:55:55,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:55,028 INFO L225 Difference]: With dead ends: 332 [2018-11-18 22:55:55,028 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:55:55,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:55:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-11-18 22:55:55,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:55,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 194 states. [2018-11-18 22:55:55,092 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 194 states. [2018-11-18 22:55:55,092 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 194 states. [2018-11-18 22:55:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:55,096 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-11-18 22:55:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-11-18 22:55:55,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:55,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:55,096 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 194 states. [2018-11-18 22:55:55,096 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 194 states. [2018-11-18 22:55:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:55,100 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-11-18 22:55:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-11-18 22:55:55,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:55,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:55,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:55,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 22:55:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-11-18 22:55:55,106 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 167 [2018-11-18 22:55:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:55,106 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-11-18 22:55:55,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:55:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-11-18 22:55:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 22:55:55,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:55,108 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:55,108 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:55,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash -209688263, now seen corresponding path program 13 times [2018-11-18 22:55:55,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:55,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:55,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:55:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:55,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {12450#true} call ULTIMATE.init(); {12450#true} is VALID [2018-11-18 22:55:55,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {12450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12450#true} is VALID [2018-11-18 22:55:55,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {12450#true} assume true; {12450#true} is VALID [2018-11-18 22:55:55,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12450#true} {12450#true} #95#return; {12450#true} is VALID [2018-11-18 22:55:55,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {12450#true} call #t~ret9 := main(); {12450#true} is VALID [2018-11-18 22:55:55,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {12450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12452#(= main_~i~0 0)} is VALID [2018-11-18 22:55:55,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {12452#(= main_~i~0 0)} assume true; {12452#(= main_~i~0 0)} is VALID [2018-11-18 22:55:55,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {12452#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12453#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:55,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {12453#(<= main_~i~0 1)} assume true; {12453#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:55,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {12453#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12454#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:55,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {12454#(<= main_~i~0 2)} assume true; {12454#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:55,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {12454#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12455#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:55,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {12455#(<= main_~i~0 3)} assume true; {12455#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:55,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {12455#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12456#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:55,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {12456#(<= main_~i~0 4)} assume true; {12456#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:55,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {12456#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12457#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:55,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {12457#(<= main_~i~0 5)} assume true; {12457#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:55,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {12457#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12458#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:55,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {12458#(<= main_~i~0 6)} assume true; {12458#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:55,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {12458#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12459#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:55,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {12459#(<= main_~i~0 7)} assume true; {12459#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:55,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {12459#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12460#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:55,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {12460#(<= main_~i~0 8)} assume true; {12460#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:55,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {12460#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12461#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:55,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {12461#(<= main_~i~0 9)} assume true; {12461#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:55,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {12461#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12462#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:55,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {12462#(<= main_~i~0 10)} assume true; {12462#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:55,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {12462#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12463#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:55,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {12463#(<= main_~i~0 11)} assume true; {12463#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:55,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {12463#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12464#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:55,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {12464#(<= main_~i~0 12)} assume true; {12464#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:55,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {12464#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12465#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:55,831 INFO L273 TraceCheckUtils]: 32: Hoare triple {12465#(<= main_~i~0 13)} assume true; {12465#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:55,832 INFO L273 TraceCheckUtils]: 33: Hoare triple {12465#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12466#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:55,832 INFO L273 TraceCheckUtils]: 34: Hoare triple {12466#(<= main_~i~0 14)} assume true; {12466#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:55,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {12466#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12467#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:55,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#(<= main_~i~0 15)} assume true; {12467#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:55,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:55,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:55,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 54: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 55: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 56: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 63: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,839 INFO L273 TraceCheckUtils]: 71: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 72: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 73: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 74: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 78: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,840 INFO L273 TraceCheckUtils]: 79: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 81: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 86: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 87: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,841 INFO L273 TraceCheckUtils]: 88: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 89: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 90: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 91: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 92: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 93: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 94: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 95: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 96: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,842 INFO L273 TraceCheckUtils]: 97: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 98: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 99: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 100: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 101: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 102: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 103: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 104: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 105: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,843 INFO L273 TraceCheckUtils]: 106: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 107: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 108: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 109: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 110: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 111: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 112: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 113: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 114: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 116: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 117: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 118: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 119: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 120: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 121: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 122: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 123: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,845 INFO L273 TraceCheckUtils]: 124: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 125: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 126: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 127: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 128: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 129: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 130: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 131: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 132: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,846 INFO L273 TraceCheckUtils]: 133: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 134: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 135: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 136: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 137: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 138: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 139: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 140: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 141: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,847 INFO L273 TraceCheckUtils]: 142: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 143: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 144: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 145: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 146: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 147: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 148: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 149: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,848 INFO L273 TraceCheckUtils]: 150: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 151: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 152: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 153: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 154: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 155: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 156: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 157: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 158: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,849 INFO L273 TraceCheckUtils]: 159: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 160: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 161: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 162: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 163: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 164: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 165: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 166: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 167: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,850 INFO L273 TraceCheckUtils]: 168: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 169: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 170: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 171: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 172: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 173: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 174: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 175: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 176: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,851 INFO L273 TraceCheckUtils]: 177: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 178: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 179: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 180: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 181: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 182: Hoare triple {12451#false} havoc ~x~0;~x~0 := 0; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 183: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 184: Hoare triple {12451#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L256 TraceCheckUtils]: 185: Hoare triple {12451#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {12451#false} is VALID [2018-11-18 22:55:55,852 INFO L273 TraceCheckUtils]: 186: Hoare triple {12451#false} ~cond := #in~cond; {12451#false} is VALID [2018-11-18 22:55:55,853 INFO L273 TraceCheckUtils]: 187: Hoare triple {12451#false} assume 0 == ~cond; {12451#false} is VALID [2018-11-18 22:55:55,853 INFO L273 TraceCheckUtils]: 188: Hoare triple {12451#false} assume !false; {12451#false} is VALID [2018-11-18 22:55:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-11-18 22:55:55,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:55,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:55:55,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:55:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:55,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:56,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {12450#true} call ULTIMATE.init(); {12450#true} is VALID [2018-11-18 22:55:56,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {12450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12450#true} is VALID [2018-11-18 22:55:56,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {12450#true} assume true; {12450#true} is VALID [2018-11-18 22:55:56,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12450#true} {12450#true} #95#return; {12450#true} is VALID [2018-11-18 22:55:56,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {12450#true} call #t~ret9 := main(); {12450#true} is VALID [2018-11-18 22:55:56,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {12450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12486#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:56,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {12486#(<= main_~i~0 0)} assume true; {12486#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:56,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {12486#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12453#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:56,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {12453#(<= main_~i~0 1)} assume true; {12453#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:56,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {12453#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12454#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:56,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {12454#(<= main_~i~0 2)} assume true; {12454#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:56,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {12454#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12455#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:56,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {12455#(<= main_~i~0 3)} assume true; {12455#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:56,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {12455#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12456#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:56,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {12456#(<= main_~i~0 4)} assume true; {12456#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:56,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {12456#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12457#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:56,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {12457#(<= main_~i~0 5)} assume true; {12457#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:56,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {12457#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12458#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:56,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {12458#(<= main_~i~0 6)} assume true; {12458#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:56,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {12458#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12459#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:56,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {12459#(<= main_~i~0 7)} assume true; {12459#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:56,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {12459#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12460#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:56,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {12460#(<= main_~i~0 8)} assume true; {12460#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:56,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {12460#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12461#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:56,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {12461#(<= main_~i~0 9)} assume true; {12461#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:56,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {12461#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12462#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:56,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {12462#(<= main_~i~0 10)} assume true; {12462#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:56,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {12462#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12463#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:56,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {12463#(<= main_~i~0 11)} assume true; {12463#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:56,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {12463#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12464#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:56,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {12464#(<= main_~i~0 12)} assume true; {12464#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:56,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {12464#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12465#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:56,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {12465#(<= main_~i~0 13)} assume true; {12465#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:56,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {12465#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12466#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:56,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {12466#(<= main_~i~0 14)} assume true; {12466#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:56,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {12466#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12467#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:56,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#(<= main_~i~0 15)} assume true; {12467#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:56,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:56,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:56,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,274 INFO L273 TraceCheckUtils]: 47: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,274 INFO L273 TraceCheckUtils]: 48: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,275 INFO L273 TraceCheckUtils]: 53: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 58: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 62: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,278 INFO L273 TraceCheckUtils]: 71: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 73: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 74: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 75: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 76: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 81: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 82: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12451#false} is VALID [2018-11-18 22:55:56,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {12451#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 84: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 85: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 86: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 87: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 88: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,281 INFO L273 TraceCheckUtils]: 89: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 90: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 92: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 93: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 94: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,282 INFO L273 TraceCheckUtils]: 95: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 96: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 97: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 98: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 99: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 100: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,283 INFO L273 TraceCheckUtils]: 101: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 102: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 103: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 104: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 105: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 106: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 107: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,284 INFO L273 TraceCheckUtils]: 108: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 109: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 110: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 111: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 112: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 113: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,285 INFO L273 TraceCheckUtils]: 114: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 115: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 116: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 117: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 118: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 119: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,286 INFO L273 TraceCheckUtils]: 120: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 121: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 122: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 123: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 124: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 125: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,287 INFO L273 TraceCheckUtils]: 126: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 127: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 128: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 129: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 130: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 131: Hoare triple {12451#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 132: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,288 INFO L273 TraceCheckUtils]: 133: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 134: Hoare triple {12451#false} ~i~0 := 0; {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 135: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 136: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 137: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 138: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,289 INFO L273 TraceCheckUtils]: 139: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 140: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 141: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 142: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 143: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 144: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,290 INFO L273 TraceCheckUtils]: 145: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 146: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 147: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 148: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 149: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 150: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 151: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,291 INFO L273 TraceCheckUtils]: 152: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 153: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 154: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 155: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 156: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 157: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,292 INFO L273 TraceCheckUtils]: 158: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 159: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 160: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 161: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 162: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 163: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,293 INFO L273 TraceCheckUtils]: 164: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 165: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 166: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 167: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 168: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 169: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 170: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,294 INFO L273 TraceCheckUtils]: 171: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 172: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 173: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 174: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 175: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 176: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,295 INFO L273 TraceCheckUtils]: 177: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 178: Hoare triple {12451#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 179: Hoare triple {12451#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 180: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 181: Hoare triple {12451#false} assume !(~i~0 < 100000); {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 182: Hoare triple {12451#false} havoc ~x~0;~x~0 := 0; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 183: Hoare triple {12451#false} assume true; {12451#false} is VALID [2018-11-18 22:55:56,296 INFO L273 TraceCheckUtils]: 184: Hoare triple {12451#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12451#false} is VALID [2018-11-18 22:55:56,297 INFO L256 TraceCheckUtils]: 185: Hoare triple {12451#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {12451#false} is VALID [2018-11-18 22:55:56,297 INFO L273 TraceCheckUtils]: 186: Hoare triple {12451#false} ~cond := #in~cond; {12451#false} is VALID [2018-11-18 22:55:56,297 INFO L273 TraceCheckUtils]: 187: Hoare triple {12451#false} assume 0 == ~cond; {12451#false} is VALID [2018-11-18 22:55:56,297 INFO L273 TraceCheckUtils]: 188: Hoare triple {12451#false} assume !false; {12451#false} is VALID [2018-11-18 22:55:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-11-18 22:55:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:56,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:55:56,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 189 [2018-11-18 22:55:56,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:56,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:55:56,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:56,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:55:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:55:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:56,403 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 19 states. [2018-11-18 22:55:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:57,353 INFO L93 Difference]: Finished difference Result 364 states and 375 transitions. [2018-11-18 22:55:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:55:57,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 189 [2018-11-18 22:55:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:55:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 243 transitions. [2018-11-18 22:55:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:55:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 243 transitions. [2018-11-18 22:55:57,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 243 transitions. [2018-11-18 22:55:57,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:57,657 INFO L225 Difference]: With dead ends: 364 [2018-11-18 22:55:57,658 INFO L226 Difference]: Without dead ends: 208 [2018-11-18 22:55:57,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:55:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-18 22:55:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2018-11-18 22:55:57,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:55:57,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 205 states. [2018-11-18 22:55:57,765 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 205 states. [2018-11-18 22:55:57,765 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 205 states. [2018-11-18 22:55:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:57,769 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2018-11-18 22:55:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-18 22:55:57,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:57,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:57,770 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 208 states. [2018-11-18 22:55:57,770 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 208 states. [2018-11-18 22:55:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:55:57,774 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2018-11-18 22:55:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-11-18 22:55:57,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:55:57,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:55:57,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:55:57,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:55:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 22:55:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2018-11-18 22:55:57,780 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 189 [2018-11-18 22:55:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:55:57,780 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2018-11-18 22:55:57,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:55:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2018-11-18 22:55:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-18 22:55:57,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:55:57,782 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:55:57,782 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:55:57,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:55:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1324183005, now seen corresponding path program 14 times [2018-11-18 22:55:57,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:55:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:55:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:55:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:55:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:58,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {14221#true} call ULTIMATE.init(); {14221#true} is VALID [2018-11-18 22:55:58,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {14221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14221#true} is VALID [2018-11-18 22:55:58,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {14221#true} assume true; {14221#true} is VALID [2018-11-18 22:55:58,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14221#true} {14221#true} #95#return; {14221#true} is VALID [2018-11-18 22:55:58,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {14221#true} call #t~ret9 := main(); {14221#true} is VALID [2018-11-18 22:55:58,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {14221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14223#(= main_~i~0 0)} is VALID [2018-11-18 22:55:58,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {14223#(= main_~i~0 0)} assume true; {14223#(= main_~i~0 0)} is VALID [2018-11-18 22:55:58,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {14223#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14224#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:58,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {14224#(<= main_~i~0 1)} assume true; {14224#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:58,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {14224#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14225#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:58,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {14225#(<= main_~i~0 2)} assume true; {14225#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:58,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {14225#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14226#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:58,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {14226#(<= main_~i~0 3)} assume true; {14226#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:58,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {14226#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14227#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:58,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {14227#(<= main_~i~0 4)} assume true; {14227#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:58,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {14227#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14228#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:58,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {14228#(<= main_~i~0 5)} assume true; {14228#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:58,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {14228#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14229#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:58,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {14229#(<= main_~i~0 6)} assume true; {14229#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:58,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {14229#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14230#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:58,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {14230#(<= main_~i~0 7)} assume true; {14230#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:58,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {14230#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14231#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:58,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {14231#(<= main_~i~0 8)} assume true; {14231#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:58,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {14231#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14232#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:58,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {14232#(<= main_~i~0 9)} assume true; {14232#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:58,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {14232#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14233#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:58,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {14233#(<= main_~i~0 10)} assume true; {14233#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:58,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {14233#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14234#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:58,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {14234#(<= main_~i~0 11)} assume true; {14234#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:58,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {14234#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14235#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:58,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {14235#(<= main_~i~0 12)} assume true; {14235#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:58,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {14235#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14236#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:58,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {14236#(<= main_~i~0 13)} assume true; {14236#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:58,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {14236#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14237#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:58,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {14237#(<= main_~i~0 14)} assume true; {14237#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:58,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {14237#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14238#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:58,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {14238#(<= main_~i~0 15)} assume true; {14238#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:58,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {14238#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14239#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:58,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {14239#(<= main_~i~0 16)} assume true; {14239#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:58,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {14239#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:58,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:58,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 54: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 55: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 56: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,785 INFO L273 TraceCheckUtils]: 59: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 60: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 61: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 62: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 63: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 64: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 66: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 67: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 69: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 72: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 91: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 93: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 96: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 105: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 106: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 107: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 109: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 110: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 115: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 116: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 118: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 122: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 123: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 127: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 128: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 130: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 131: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 132: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 133: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 135: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 136: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,794 INFO L273 TraceCheckUtils]: 137: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 138: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 139: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 140: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 141: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 142: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 143: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 144: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,795 INFO L273 TraceCheckUtils]: 145: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 146: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 147: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 148: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 149: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 150: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 151: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 152: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 153: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,796 INFO L273 TraceCheckUtils]: 154: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 155: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 156: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 157: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 158: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 159: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 160: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 161: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 162: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,797 INFO L273 TraceCheckUtils]: 163: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 164: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 165: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 166: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 167: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 168: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 169: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 170: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 171: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,798 INFO L273 TraceCheckUtils]: 172: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 173: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 174: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 175: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 176: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 177: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 178: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 179: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 180: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,799 INFO L273 TraceCheckUtils]: 181: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 182: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 183: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 184: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 185: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 186: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 187: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 188: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 189: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:58,800 INFO L273 TraceCheckUtils]: 190: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 191: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 192: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 193: Hoare triple {14222#false} havoc ~x~0;~x~0 := 0; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 194: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 195: Hoare triple {14222#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L256 TraceCheckUtils]: 196: Hoare triple {14222#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 197: Hoare triple {14222#false} ~cond := #in~cond; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 198: Hoare triple {14222#false} assume 0 == ~cond; {14222#false} is VALID [2018-11-18 22:55:58,801 INFO L273 TraceCheckUtils]: 199: Hoare triple {14222#false} assume !false; {14222#false} is VALID [2018-11-18 22:55:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-11-18 22:55:58,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:55:58,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:55:58,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:55:58,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:55:58,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:55:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:55:58,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:55:59,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {14221#true} call ULTIMATE.init(); {14221#true} is VALID [2018-11-18 22:55:59,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {14221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14221#true} is VALID [2018-11-18 22:55:59,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {14221#true} assume true; {14221#true} is VALID [2018-11-18 22:55:59,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14221#true} {14221#true} #95#return; {14221#true} is VALID [2018-11-18 22:55:59,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {14221#true} call #t~ret9 := main(); {14221#true} is VALID [2018-11-18 22:55:59,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {14221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14258#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:59,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {14258#(<= main_~i~0 0)} assume true; {14258#(<= main_~i~0 0)} is VALID [2018-11-18 22:55:59,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {14258#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14224#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:59,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {14224#(<= main_~i~0 1)} assume true; {14224#(<= main_~i~0 1)} is VALID [2018-11-18 22:55:59,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {14224#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14225#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:59,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {14225#(<= main_~i~0 2)} assume true; {14225#(<= main_~i~0 2)} is VALID [2018-11-18 22:55:59,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {14225#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14226#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:59,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {14226#(<= main_~i~0 3)} assume true; {14226#(<= main_~i~0 3)} is VALID [2018-11-18 22:55:59,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {14226#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14227#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:59,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {14227#(<= main_~i~0 4)} assume true; {14227#(<= main_~i~0 4)} is VALID [2018-11-18 22:55:59,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {14227#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14228#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:59,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {14228#(<= main_~i~0 5)} assume true; {14228#(<= main_~i~0 5)} is VALID [2018-11-18 22:55:59,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {14228#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14229#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:59,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {14229#(<= main_~i~0 6)} assume true; {14229#(<= main_~i~0 6)} is VALID [2018-11-18 22:55:59,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {14229#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14230#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:59,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {14230#(<= main_~i~0 7)} assume true; {14230#(<= main_~i~0 7)} is VALID [2018-11-18 22:55:59,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {14230#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14231#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:59,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {14231#(<= main_~i~0 8)} assume true; {14231#(<= main_~i~0 8)} is VALID [2018-11-18 22:55:59,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {14231#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14232#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:59,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {14232#(<= main_~i~0 9)} assume true; {14232#(<= main_~i~0 9)} is VALID [2018-11-18 22:55:59,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {14232#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14233#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:59,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {14233#(<= main_~i~0 10)} assume true; {14233#(<= main_~i~0 10)} is VALID [2018-11-18 22:55:59,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {14233#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14234#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:59,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {14234#(<= main_~i~0 11)} assume true; {14234#(<= main_~i~0 11)} is VALID [2018-11-18 22:55:59,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {14234#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14235#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:59,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {14235#(<= main_~i~0 12)} assume true; {14235#(<= main_~i~0 12)} is VALID [2018-11-18 22:55:59,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {14235#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14236#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:59,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {14236#(<= main_~i~0 13)} assume true; {14236#(<= main_~i~0 13)} is VALID [2018-11-18 22:55:59,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {14236#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14237#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:59,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {14237#(<= main_~i~0 14)} assume true; {14237#(<= main_~i~0 14)} is VALID [2018-11-18 22:55:59,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {14237#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14238#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {14238#(<= main_~i~0 15)} assume true; {14238#(<= main_~i~0 15)} is VALID [2018-11-18 22:55:59,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {14238#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14239#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {14239#(<= main_~i~0 16)} assume true; {14239#(<= main_~i~0 16)} is VALID [2018-11-18 22:55:59,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {14239#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:59,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:59,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 66: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 68: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 70: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 71: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 76: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 78: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 79: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 80: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 83: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 85: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,543 INFO L273 TraceCheckUtils]: 86: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 87: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 88: Hoare triple {14222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 89: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 90: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 91: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 92: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 93: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 94: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,544 INFO L273 TraceCheckUtils]: 95: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 96: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 97: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 98: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 99: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 100: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 101: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 102: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 103: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,545 INFO L273 TraceCheckUtils]: 104: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 105: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 106: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 107: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 108: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 109: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 110: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 111: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,546 INFO L273 TraceCheckUtils]: 112: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 113: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 114: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 115: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 116: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 117: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 118: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 119: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 120: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,547 INFO L273 TraceCheckUtils]: 121: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 122: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 123: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 124: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 125: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 126: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 127: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 128: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 129: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,548 INFO L273 TraceCheckUtils]: 130: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 131: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 132: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 133: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 134: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 135: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 136: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 137: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 138: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14222#false} is VALID [2018-11-18 22:55:59,549 INFO L273 TraceCheckUtils]: 139: Hoare triple {14222#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 140: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 141: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 142: Hoare triple {14222#false} ~i~0 := 0; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 143: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 144: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 145: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 146: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 147: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,550 INFO L273 TraceCheckUtils]: 148: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 149: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 150: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 151: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 152: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 153: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 154: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 155: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 156: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,551 INFO L273 TraceCheckUtils]: 157: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 158: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 159: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 160: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 161: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 162: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 163: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 164: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 165: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,552 INFO L273 TraceCheckUtils]: 166: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 167: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 168: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 169: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 170: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 171: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 172: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 173: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 174: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,553 INFO L273 TraceCheckUtils]: 175: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 176: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 177: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 178: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 179: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 180: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 181: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 182: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 183: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,554 INFO L273 TraceCheckUtils]: 184: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 185: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 186: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 187: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 188: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 189: Hoare triple {14222#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 190: Hoare triple {14222#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 191: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 192: Hoare triple {14222#false} assume !(~i~0 < 100000); {14222#false} is VALID [2018-11-18 22:55:59,555 INFO L273 TraceCheckUtils]: 193: Hoare triple {14222#false} havoc ~x~0;~x~0 := 0; {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L273 TraceCheckUtils]: 194: Hoare triple {14222#false} assume true; {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L273 TraceCheckUtils]: 195: Hoare triple {14222#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L256 TraceCheckUtils]: 196: Hoare triple {14222#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L273 TraceCheckUtils]: 197: Hoare triple {14222#false} ~cond := #in~cond; {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L273 TraceCheckUtils]: 198: Hoare triple {14222#false} assume 0 == ~cond; {14222#false} is VALID [2018-11-18 22:55:59,556 INFO L273 TraceCheckUtils]: 199: Hoare triple {14222#false} assume !false; {14222#false} is VALID [2018-11-18 22:55:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-11-18 22:55:59,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:55:59,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:55:59,592 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 200 [2018-11-18 22:55:59,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:55:59,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:55:59,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:55:59,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:55:59,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:55:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:55:59,668 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 20 states. [2018-11-18 22:56:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:01,029 INFO L93 Difference]: Finished difference Result 384 states and 395 transitions. [2018-11-18 22:56:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:56:01,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 200 [2018-11-18 22:56:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 254 transitions. [2018-11-18 22:56:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:56:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 254 transitions. [2018-11-18 22:56:01,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 254 transitions. [2018-11-18 22:56:02,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:02,946 INFO L225 Difference]: With dead ends: 384 [2018-11-18 22:56:02,946 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 22:56:02,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:56:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 22:56:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-11-18 22:56:03,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:03,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 216 states. [2018-11-18 22:56:03,067 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 216 states. [2018-11-18 22:56:03,067 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 216 states. [2018-11-18 22:56:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:03,071 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-11-18 22:56:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-11-18 22:56:03,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:03,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:03,071 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 219 states. [2018-11-18 22:56:03,071 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 219 states. [2018-11-18 22:56:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:03,075 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-11-18 22:56:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-11-18 22:56:03,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:03,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:03,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:03,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-18 22:56:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2018-11-18 22:56:03,081 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 200 [2018-11-18 22:56:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:03,081 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2018-11-18 22:56:03,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:56:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2018-11-18 22:56:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 22:56:03,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:03,083 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:03,083 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:03,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 606762669, now seen corresponding path program 15 times [2018-11-18 22:56:03,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:03,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:03,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {16090#true} call ULTIMATE.init(); {16090#true} is VALID [2018-11-18 22:56:03,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {16090#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16090#true} is VALID [2018-11-18 22:56:03,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {16090#true} assume true; {16090#true} is VALID [2018-11-18 22:56:03,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16090#true} {16090#true} #95#return; {16090#true} is VALID [2018-11-18 22:56:03,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {16090#true} call #t~ret9 := main(); {16090#true} is VALID [2018-11-18 22:56:03,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {16090#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16092#(= main_~i~0 0)} is VALID [2018-11-18 22:56:03,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {16092#(= main_~i~0 0)} assume true; {16092#(= main_~i~0 0)} is VALID [2018-11-18 22:56:03,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {16092#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16093#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:03,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {16093#(<= main_~i~0 1)} assume true; {16093#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:03,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {16093#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16094#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:03,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {16094#(<= main_~i~0 2)} assume true; {16094#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:03,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {16094#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16095#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:03,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {16095#(<= main_~i~0 3)} assume true; {16095#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:03,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {16095#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16096#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:03,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {16096#(<= main_~i~0 4)} assume true; {16096#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:03,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {16096#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16097#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:03,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {16097#(<= main_~i~0 5)} assume true; {16097#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:03,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {16097#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16098#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:03,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {16098#(<= main_~i~0 6)} assume true; {16098#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:03,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {16098#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16099#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:03,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {16099#(<= main_~i~0 7)} assume true; {16099#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:03,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {16099#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16100#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:03,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {16100#(<= main_~i~0 8)} assume true; {16100#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:03,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {16100#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16101#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:03,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {16101#(<= main_~i~0 9)} assume true; {16101#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:03,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {16101#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16102#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:03,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {16102#(<= main_~i~0 10)} assume true; {16102#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:03,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {16102#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16103#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:03,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {16103#(<= main_~i~0 11)} assume true; {16103#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:03,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {16103#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16104#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:03,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {16104#(<= main_~i~0 12)} assume true; {16104#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:03,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {16104#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16105#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:03,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {16105#(<= main_~i~0 13)} assume true; {16105#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:03,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {16105#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16106#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:03,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {16106#(<= main_~i~0 14)} assume true; {16106#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:03,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {16106#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16107#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:03,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {16107#(<= main_~i~0 15)} assume true; {16107#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:03,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {16107#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16108#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:03,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {16108#(<= main_~i~0 16)} assume true; {16108#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:03,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {16108#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16109#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:04,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {16109#(<= main_~i~0 17)} assume true; {16109#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:04,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {16109#(<= main_~i~0 17)} assume !(~i~0 < 100000); {16091#false} is VALID [2018-11-18 22:56:04,016 INFO L273 TraceCheckUtils]: 42: Hoare triple {16091#false} ~i~0 := 0; {16091#false} is VALID [2018-11-18 22:56:04,016 INFO L273 TraceCheckUtils]: 43: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,016 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,016 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,019 INFO L273 TraceCheckUtils]: 58: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,019 INFO L273 TraceCheckUtils]: 60: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,020 INFO L273 TraceCheckUtils]: 62: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,020 INFO L273 TraceCheckUtils]: 63: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,020 INFO L273 TraceCheckUtils]: 64: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,021 INFO L273 TraceCheckUtils]: 66: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,021 INFO L273 TraceCheckUtils]: 68: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,021 INFO L273 TraceCheckUtils]: 69: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 72: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 73: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 74: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,023 INFO L273 TraceCheckUtils]: 79: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,023 INFO L273 TraceCheckUtils]: 81: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 82: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 83: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 84: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 85: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 86: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,024 INFO L273 TraceCheckUtils]: 87: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 88: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 89: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 90: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 91: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 92: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {16091#false} is VALID [2018-11-18 22:56:04,025 INFO L273 TraceCheckUtils]: 93: Hoare triple {16091#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#false} is VALID [2018-11-18 22:56:04,026 INFO L273 TraceCheckUtils]: 94: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,026 INFO L273 TraceCheckUtils]: 95: Hoare triple {16091#false} assume !(~i~0 < 100000); {16091#false} is VALID [2018-11-18 22:56:04,026 INFO L273 TraceCheckUtils]: 96: Hoare triple {16091#false} ~i~0 := 0; {16091#false} is VALID [2018-11-18 22:56:04,026 INFO L273 TraceCheckUtils]: 97: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,026 INFO L273 TraceCheckUtils]: 98: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 99: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 100: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 101: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 102: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 103: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,027 INFO L273 TraceCheckUtils]: 104: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 105: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 106: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 107: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 108: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 109: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 110: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,028 INFO L273 TraceCheckUtils]: 111: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 112: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 113: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 114: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 115: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 116: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,029 INFO L273 TraceCheckUtils]: 117: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 118: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 119: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 121: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 122: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,030 INFO L273 TraceCheckUtils]: 123: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 124: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 125: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 126: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 127: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 128: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,031 INFO L273 TraceCheckUtils]: 129: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 130: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 131: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 132: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 133: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 134: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,032 INFO L273 TraceCheckUtils]: 135: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 136: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 137: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 138: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 139: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 140: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,033 INFO L273 TraceCheckUtils]: 141: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 142: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 143: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 144: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 145: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 146: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16091#false} is VALID [2018-11-18 22:56:04,034 INFO L273 TraceCheckUtils]: 147: Hoare triple {16091#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 148: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 149: Hoare triple {16091#false} assume !(~i~0 < 100000); {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 150: Hoare triple {16091#false} ~i~0 := 0; {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 151: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 152: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,035 INFO L273 TraceCheckUtils]: 153: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 154: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 155: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 156: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 157: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 158: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,036 INFO L273 TraceCheckUtils]: 159: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 160: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 161: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 162: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 163: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 164: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,037 INFO L273 TraceCheckUtils]: 165: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 166: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 167: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 168: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 169: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 170: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,038 INFO L273 TraceCheckUtils]: 171: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 172: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 173: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 174: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 175: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 176: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,039 INFO L273 TraceCheckUtils]: 177: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 178: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 179: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 180: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 181: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 182: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 183: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,040 INFO L273 TraceCheckUtils]: 184: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 185: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 186: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 187: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 188: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 189: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,041 INFO L273 TraceCheckUtils]: 190: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 191: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 192: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 193: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 194: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 195: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,042 INFO L273 TraceCheckUtils]: 196: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 197: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 198: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 199: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 200: Hoare triple {16091#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem5;havoc #t~mem6; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 201: Hoare triple {16091#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 202: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,043 INFO L273 TraceCheckUtils]: 203: Hoare triple {16091#false} assume !(~i~0 < 100000); {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L273 TraceCheckUtils]: 204: Hoare triple {16091#false} havoc ~x~0;~x~0 := 0; {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L273 TraceCheckUtils]: 205: Hoare triple {16091#false} assume true; {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L273 TraceCheckUtils]: 206: Hoare triple {16091#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L256 TraceCheckUtils]: 207: Hoare triple {16091#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L273 TraceCheckUtils]: 208: Hoare triple {16091#false} ~cond := #in~cond; {16091#false} is VALID [2018-11-18 22:56:04,044 INFO L273 TraceCheckUtils]: 209: Hoare triple {16091#false} assume 0 == ~cond; {16091#false} is VALID [2018-11-18 22:56:04,045 INFO L273 TraceCheckUtils]: 210: Hoare triple {16091#false} assume !false; {16091#false} is VALID [2018-11-18 22:56:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-18 22:56:04,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:04,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2